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

DOI10.1155/2020/4197678zbMath1459.05069OpenAlexW3088316435MaRDI QIDQ2004177

Muhammad Imran, Jianxin Wei, Ghulam Abbas, Syed Ahtsham ul Haq Bokhary

Publication date: 14 October 2020

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

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

Mathematics Subject Classification ID

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

Cites Work

• On classes of regular graphs with constant metric dimension
• On the metric dimension of circulant graphs
• On families of convex polytopes with constant metric dimension
• On \(k\)-dimensional graphs and their bases
• Resolvability in graphs and the metric dimension of a graph
• On the metric dimension of barcycentric subdivision of Cayley graphs $Cay(Z_{n}\oplus Z_{m})$
• The Metric Dimension of Circulant Graphs
• Metric bases in digital geometry
• The metric dimension of the circulant graph $C(n,\pm\{1,2,3,4\})$
• The metric dimension of circulant graphs and their Cartesian products
• On resolvability of a graph associated to a finite vector space
• On Metric Generators of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Resolvability in subdivision of circulant networks \(C_n[1, k]\)