The metric dimension of the circulant graph C(n,\1,2,3,4\)
From MaRDI portal
Publication:4595672
Abstract: Let be a connected graph and let denote the distance between vertices . A metric basis for is a set of minimum cardinality such that no two vertices of have the same distances to all points of . The cardinality of a metric basis of is called the metric dimension of , denoted by . In this paper we determine the metric dimension of the circulant graphs for all values of .
Recommendations
Cited in
(13)- Minimum metric dimension of Illiac networks.
- Metric properties of generalized Sierpiński graphs over stars
- Resolvability in subdivision of circulant networks \(C_n[1, k]\)
- Metric dimension of generalized wheels
- Edge metric dimension of some classes of circulant graphs
- All metric bases and fault-tolerant metric dimension for square of grid
- On the metric dimension and diameter of circulant graphs with three jumps
- Metric basis in circulant networks.
- On the metric dimension of circulant graphs
- Graphs with same diameter and metric dimension
- scientific article; zbMATH DE number 7390801 (Why is no real title available?)
- The secure metric dimension of the globe graph and the flag graph
- The Metric Dimension of Circulant Graphs
This page was built for publication: The metric dimension of the circulant graph \(C(n,\pm\{1,2,3,4\})\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595672)