Searching for geodetic boundary vertex sets

DOI10.1016/J.ENDM.2005.05.005MaRDI QIDQ3439657zbMATH OpenOpenAlexFDO

Authors

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)

Cited in

(9)

• Strong resolving graphs: the realization and the characterization problems
• On the strong metric dimension of Cartesian and direct products of graphs
• Monophonic convexity in weighted graphs
• Bounds and algorithms for geodetic hulls
• General position problems in strong and lexicographic products of graphs
• Improved bounds for geodetic hulls
• The simultaneous strong metric dimension of graph families
• On the geodetic number of median graphs
• On the geodetic number and related metric sets in Cartesian product graphs

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

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