Resolvability in subdivision of circulant networks C_n[1, k]

DOI10.1155/2020/4197678MaRDI QIDQ2004177zbMATH OpenOpenAlexFDO

Authors Jianxin Wei, Ghulam Abbas, M. Imran, Syed Ahtsham Ul Haq Bokhary

Publication date 14 October 2020

Published in Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2020/4197678

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80)

Review text

Summary: Circulant networks form a very important and widely explored class of graphs due to their interesting and wide-range applications in networking, facility location problems, and their symmetric properties. A resolving set is a subset of vertices of a connected graph such that each vertex of the graph is determined uniquely by its distances to that set. A resolving set of the graph that has the minimum cardinality is called the basis of the graph, and the number of elements in the basis is called the metric dimension of the graph. In this paper, the metric dimension is computed for the graph \(G_n[1, k]\) constructed from the circulant graph \(C_n[1, k]\) by subdividing its edges. We have shown that, for \(k=2\), \(G_n[1, k]\) has an unbounded metric dimension, and for \(k=3\) and 4, \(G_n[1, k]\) has a bounded metric dimension.

Recommendations

• Metric basis in circulant networks.
• On the metric dimension of circulant graphs
• Resolvability in circulant graphs
• The Metric Dimension of Circulant Graphs
• scientific article; zbMATH DE number 7390801

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\})\)

Cited in

(1)

• Metric dimension: a review article

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)