An algebraic characterization of geodetic graphs

DOI10.1023/A:1022435605919zbMath0949.05022OpenAlexW178570493MaRDI QIDQ4515332

Ladislav Nebeský

Publication date: 13 November 2000

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

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

zbMATH Keywords

binary operationconnected graphgeodetic graph

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, A monoid structure on the set of all binary operations over a fixed set, The Non-confusing Travel Groupoids on a Finite Connected Graph, Characterizations of the simple non-confusing travel groupoids on a finite graph, Travel groupoids, An axiomatic approach to metric properties of connected graphs, Travel groupoids on infinite graphs, New proof of a characterization of geodetic graphs

Cites Work

• Geodesics and steps in a connected graph
• A characterization of geodetic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item