On the metric dimension of directed and undirected circulant graphs

DOI10.7151/dmgt.2110zbMath1437.05114OpenAlexW2805270699WikidataQ129712573 ScholiaQ129712573MaRDI QIDQ2282465

Tomáš Vetrík

Publication date: 8 January 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2110

zbMATH Keywords

distancecirculant graphresolving setmetric dimension

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (3)

On weak metric dimension of digraphs ⋮ Unnamed Item ⋮ Edge metric dimensions via hierarchical product and integer linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• On the metric dimension of circulant and Harary graphs
• On the metric dimension of circulant graphs
• On the metric dimension of barycentric subdivision of Cayley graphs
• Resolvability in graphs and the metric dimension of a graph
• Resolvability in circulant graphs
• Landmarks in graphs
• The Metric Dimension of Circulant Graphs
• Metric bases in digital geometry
• The metric dimension of circulant graphs and their Cartesian products
• The metric dimension of the lexicographic product of graphs

This page was built for publication: On the metric dimension of directed and undirected circulant graphs