New proof of a characterization of geodetic graphs

DOI10.1023/A:1021715219620zbMath0995.05124OpenAlexW1571892916MaRDI QIDQ3151374

Ladislav Nebeský

Publication date: 15 October 2002

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

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

zbMATH Keywords

shortest pathsbinary operationsgeodetic graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Sets with a single binary operation (groupoids) (20N02)

Related Items

A construction of smooth travel groupoids on finite graphs, Unnamed Item, The Non-confusing Travel Groupoids on a Finite Connected Graph, On the connectivity and diameter of geodetic graphs, Characterizations of the simple non-confusing travel groupoids on a finite graph, Travel groupoids, Travel groupoids on infinite graphs, Steiner intervals, geodesic intervals, and betweenness

Cites Work

• An algebraic characterization of geodetic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item