New proof of a characterization of geodetic graphs

DOI10.1023/A:1021715219620MaRDI QIDQ3151374zbMATH OpenOpenAlexFDO

Authors 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

binary operationsgeodetic graphsshortest paths

Mathematics Subject Classification ID

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

Recommendations

• An algebraic characterization of geodetic graphs
• A new proof of a characterization of the set of all geodesics in a connected graph
• Publication:4722092
• scientific article; zbMATH DE number 4025472
• scientific article; zbMATH DE number 4208114

Cites work

• A tree as a finite nonempty set with a binary operation
• An algebraic characterization of geodetic graphs
• scientific article; zbMATH DE number 3697163 (Why is no real title available?)
• scientific article; zbMATH DE number 1055145 (Why is no real title available?)

Cited in

(12)

• Steiner intervals, geodesic intervals, and betweenness
• Characterizations of the simple non-confusing travel groupoids on a finite graph
• A construction of smooth travel groupoids on finite graphs
• The Non-confusing Travel Groupoids on a Finite Connected Graph
• Travel groupoids
• An algebraic characterization of geodetic graphs
• A new proof of a characterization of the set of all geodesics in a connected graph
• Characterization of travel groupoids by partition systems on graphs
• Travel groupoids on infinite graphs.
• On the connectivity and diameter of geodetic graphs
• On the computational complexity of the strong geodetic recognition problem
• Travel groupoids on complete multipartite graphs

This page was built for publication: New proof of a characterization of geodetic graphs

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