The metric dimension of the circulant graph with 2k generators can be less than k
Circulant graphs are useful networks because of their symmetries. For k⩾2 and n⩾2k+1, the circulant graph Cn(1,2,…,k) consists of the vertices v0,v1,v2,…,vn-1 and the edges vivi+1,vivi+2,…,vivi+k, where i=0,1,2,…,n-1, and the subscripts are taken modulo n. The metric dimension β(Cn(1,2,…,k)) of the...
Main Authors: | Tomáš Vetrík, Muhammad Imran, Martin Knor, Riste Škrekovski |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2023-10-01
|
Series: | Journal of King Saud University: Science |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S1018364723002963 |
Similar Items
-
Metric Dimension of Circulant Graphs with 5 Consecutive Generators
by: Martin Knor, et al.
Published: (2024-05-01) -
On the Metric Dimension of Directed and Undirected Circulant Graphs
by: Vetrík Tomáš
Published: (2020-02-01) -
Remarks on the Vertex and the Edge Metric Dimension of 2-Connected Graphs
by: Martin Knor, et al.
Published: (2022-07-01) -
The metric dimension of circulant graphs
by: Tapendra BC, et al.
Published: (2024-12-01) -
Fault-Tolerant Metric Dimension of Circulant Graphs
by: Laxman Saha, et al.
Published: (2022-01-01)