Metric dimension of directed graphs
DOI10.1080/00207160.2013.844335zbMath1305.05090OpenAlexW2086945160MaRDI QIDQ2935364
Paul D. Manuel, Jude Annie Cynthia, Bharathi Rajan, Indra Rajasingh
Publication date: 29 December 2014
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2013.844335
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (7)
Cites Work
- Unnamed Item
- An efficient representation of Benes networks and its applications
- On minimum metric dimension of honeycomb networks
- A new look at the de Bruijn graph
- Broadcasting and spanning trees in de Bruijn and Kautz networks
- Product-shuffle networks: Toward reconciling shuffles and butterflies
- Resolvability in graphs and the metric dimension of a graph
- Fault-tolerant locating-dominating sets
- Landmarks in graphs
- Landmarks in torus networks
- Metric bases in digital geometry
- On Metric Generators of Graphs
This page was built for publication: Metric dimension of directed graphs