|
|
|
|
sharp lower bounds on the metric dimension of circulant graphs
|
|
|
|
|
|
|
|
نویسنده
|
knor martin ,škrekovski riste ,vetrík tomáš
|
|
منبع
|
communications in combinatorics and optimization - 2025 - دوره : 10 - شماره : 1 - صفحه:79 -98
|
|
چکیده
|
For n ≥ 2t + 1 where t ≥ 1, the circulant graph cn(1, 2, . . . , t) consists of the vertices v0, v1, v2, . . . , vn−1 and the edges vivi+1, vivi+2, . . . , vivi+t, where i = 0, 1, 2, . . . , n − 1, and the subscripts are taken modulo n. we prove that the metric dimension dim(cn(1, 2, . . . , t)) ≥ |2t/3| + 1 for t ≥ 5, where the equality holds if and only if t = 5 and n = 13. thus dim(cn(1, 2, . . . , t)) ≥ |2t/3| + 2 for t ≥ 6. this bound is sharp for every t ≥ 6.
|
|
کلیدواژه
|
cayley graph ,distance ,resolving set
|
|
آدرس
|
slovak university of technology, slovakia, university of ljubljana, faculty of mathematics and physics, slovakia. faculty of information studies, slovenia, university of the free state, department of mathematics and applied mathematics, south africa
|
|
پست الکترونیکی
|
vetrikt@ufs.ac.za
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|