On Properties of a Graph that Depend on its Distance Function

DOI10.1023/B:CMAJ.0000042383.98585.97zbMath1080.05506OpenAlexW2155920354MaRDI QIDQ3366641

Ladislav Nebeský

Publication date: 14 February 2006

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/30874

zbMATH Keywords

stepsdistanceconnected graphsgeodetically smooth graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items (5)

Intervals and steps in a connected graph ⋮ Guides and shortcuts in graphs ⋮ Distance-hereditary graphs and signpost systems ⋮ Signpost systems and spanning trees of graphs ⋮ On signpost systems and connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pseudo-modular graphs
• Geodesics and steps in a connected graph
• An axiomatic approach to metric properties of connected graphs
• A theorem for an axiomatic approach to metric properties of graphs
• Modular and median signpost systems and their underlying graphs

This page was built for publication: On Properties of a Graph that Depend on its Distance Function