On the Metric Index of Circulant Networks–An Algorithmic Approach
A vertex v of a graph G uniquely determines (resolves) a pair (v<sub>1</sub>, v<sub>2</sub>) of vertices of G if the distance between v and v<sub>1</sub> is different from the distance between v and v<sub>2</sub>. The metric index is a distance-based t...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8707005/ |