Searching for geodetic boundary vertex sets

DOI10.1016/j.endm.2005.05.005zbMath1136.05309OpenAlexW2158705342MaRDI QIDQ3439657

No author found.

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.05.005

Mathematics Subject Classification ID

Distance in graphs (05C12) Perfect graphs (05C17)

Related Items (8)

On the strong metric dimension of Cartesian and direct products of graphs ⋮ Bounds and algorithms for geodetic hulls ⋮ Strong resolving graphs: the realization and the characterization problems ⋮ Monophonic convexity in weighted graphs ⋮ On the geodetic number of median graphs ⋮ Resolvability and strong resolvability in the direct product of graphs ⋮ The simultaneous strong metric dimension of graph families ⋮ On the geodetic number and related metric sets in Cartesian product graphs

This page was built for publication: Searching for geodetic boundary vertex sets