Resolvability in subdivision of circulant networks C_n[1, k]
From MaRDI portal
Publication:2004177
Recommendations
Cites work
- scientific article; zbMATH DE number 4070954 (Why is no real title available?)
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2068163 (Why is no real title available?)
- scientific article; zbMATH DE number 7390801 (Why is no real title available?)
- scientific article; zbMATH DE number 2229025 (Why is no real title available?)
- Metric bases in digital geometry
- On \(k\)-dimensional graphs and their bases
- On classes of regular graphs with constant metric dimension
- On families of convex polytopes with constant metric dimension
- On metric dimension of flower graphs \(f_{n \times m}\) and convex polytopes
- On Metric Generators of Graphs
- On resolvability in double-step circulant graphs
- On resolvability of a graph associated to a finite vector space
- On the metric dimension of barycentric subdivision of Cayley graphs \(\mathrm{Cay}(Z_{n}\oplus Z_{m})\)
- On the metric dimension of circulant graphs
- On the metric dimension of circulant graphs with 4 generators
- Resolvability in graphs and the metric dimension of a graph
- The metric dimension of Cartesian products of graphs
- The Metric Dimension of Circulant Graphs
- The metric dimension of circulant graphs and Cayley hypergraphs
- The metric dimension of circulant graphs and their Cartesian products
- The metric dimension of the circulant graph \(C(n,\pm\{1,2,3,4\})\)
This page was built for publication: Resolvability in subdivision of circulant networks \(C_n[1, k]\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004177)