Computing the metric dimension of the categorial product of some graphs

DOI10.1080/00207160.2015.1109081zbMath1362.05042OpenAlexW2299970132MaRDI QIDQ5737870

Ali Ahmad, Tomáš Vetrík

Publication date: 30 May 2017

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2015.1109081

zbMATH Keywords

roboticsresolving setmetric dimensioncategorial product

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Automated systems (robots, etc.) in control theory (93C85) Distance in graphs (05C12) Artificial intelligence for robotics (68T40)

Related Items (3)

Partition dimension of COVID antiviral drug structures ⋮ Resolvability and strong resolvability in the direct product of graphs ⋮ On the fault-tolerant metric dimension of certain interconnection networks

Cites Work

• Unnamed Item
• Landmarks in graphs
• On the Metric Dimension of Cartesian Products of Graphs
• Metric bases in digital geometry
• The metric dimension of the lexicographic product of graphs
• The metric dimension of the lexicographic product of graphs

This page was built for publication: Computing the metric dimension of the categorial product of some graphs