Solid-resolving sets on directed graphs

DOI10.1007/978-3-032-27732-9_23MaRDI QIDQ7363393zbMATH OpenFDO

Authors Anni Hakanen

Publication date 29 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-27732-9_23

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• Boundary vertices in graphs
• Boundary vertices of Cartesian product of directed graphs
• Directed metric dimension of oriented graphs with cyclic covering
• Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• scientific article; zbMATH DE number 2170458 (Why is no real title available?)
• Metric dimension of directed graphs
• Metric dimension: from graphs to oriented graphs
• On finding the best and worst orientations for the metric dimension
• On the metric dimension of directed and undirected circulant graphs
• On the metric dimension of line graphs
• The (weighted) metric dimension of graphs: hard and easy cases
• The directed distance dimension of oriented graphs
• The metric dimension of the lexicographic product of graphs
• The solid-metric dimension
• Uniquely identifying the edges of a graph: the edge metric dimension

This page was built for publication: Solid-resolving sets on directed graphs

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