Metric basis in circulant networks.

MaRDI QIDQ4568205zbMATH OpenFDO

Authors Muhammad Naeem Azhar, Imran Javaid

Publication date 15 June 2018

zbMATH Keywords

metric dimensionresolving setcirculant graphmetric basis

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• On the metric dimension of circulant graphs
• Resolvability in circulant graphs
• The metric dimension of the circulant graph \(C(n,\pm\{1,2,3,4\})\)
• The Metric Dimension of Circulant Graphs
• On the metric dimension and diameter of circulant graphs with three jumps

Cited in

(10)

• On the metric dimension and diameter of circulant graphs with three jumps
• The metric dimension of the circulant graph \(C(n,\pm\{1,2,3,4\})\)
• On the metric dimension of circulant graphs
• Resolvability in subdivision of circulant networks \(C_n[1, k]\)
• On minimum metric dimension of honeycomb networks
• Minimum metric dimension of Illiac networks.
• On vertices contained in all or in no metric basis
• Computing a metric basis of a bipartite distance-hereditary graph
• Unique basis graphs.
• Resolvability in circulant graphs

This page was built for publication: Metric basis in circulant networks.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568205)