On the Metric Dimension of Directed and Undirected Circulant Graphs
The undirected circulant graph Cn(±1, ±2, . . . , ±t) consists of vertices v0, v1, . . . , vn−1 and undirected edges vivi+j, where 0 ≤ i ≤ n − 1, 1 ≤ j ≤ t (2 ≤ t ≤ n2{n \over 2} ), and the directed circulant graph Cn(1, t) consists of vertices v0, v1, . . . , vn−1 and directed edges vivi+1, vivi+t...
Main Author: | Vetrík Tomáš |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2020-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2110 |
Similar Items
-
On the metric dimension of bipartite graphs
by: M. Anandha Jothi, et al.
Published: (2023-09-01) -
Metric Dimension of Circulant Graphs with 5 Consecutive Generators
by: Martin Knor, et al.
Published: (2024-05-01) -
Edge metric dimension of some classes of circulant graphs
by: Ahsan Muhammad, et al.
Published: (2020-12-01) -
The metric dimension of the circulant graph with 2k generators can be less than k
by: Tomáš Vetrík, et al.
Published: (2023-10-01) -
The Threshold Dimension and Irreducible Graphs
by: Mol Lucas, et al.
Published: (2023-02-01)