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...

Full description

Bibliographic Details
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