On Properties of a Graph that Depend on its Distance Function

DOI10.1023/B:CMAJ.0000042383.98585.97zbMATH Open1080.05506OpenAlexW2155920354MaRDI QIDQ3366641FDOQ3366641

Authors: 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

Recommendations

• An axiomatic approach to metric properties of connected graphs
• Intervals and steps in a connected graph
• scientific article; zbMATH DE number 3843789
• A theorem for an axiomatic approach to metric properties of graphs
• Geodesics and steps in a connected graph

zbMATH Keywords

distancestepsconnected graphsgeodetically smooth graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A tree as a finite nonempty set with a binary operation
• Geodesics and steps in a connected graph
• An axiomatic approach to metric properties of connected graphs
• Modular and median signpost systems and their underlying graphs
• Pseudo-modular graphs
• A theorem for an axiomatic approach to metric properties of graphs

Cited In (7)

• Distance-hereditary graphs and signpost systems
• Intervals and steps in a connected graph
• On signpost systems and connected graphs
• Signpost systems and spanning trees of graphs
• A theorem for an axiomatic approach to metric properties of graphs
• Title not available (Why is that?)
• Guides and shortcuts in graphs

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

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