An algebraic characterization of geodetic graphs
- 1 December 1998
- journal article
- Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak Mathematical Journal
- Vol. 48 (4) , 701-710
- https://doi.org/10.1023/a:1022435605919
Abstract
We say that a binary operation * is associated with a (finite undirected) graph G (without loops and multiple edges) if * is defined on V(G) and uv ∈ E(G) if and only if u ≠ v, u * v = v and v * u = uKeywords
This publication has 4 references indexed in Scilit:
- Geodesics and steps in a connected graphCzechoslovak Mathematical Journal, 1997
- A characterization of geodetic graphsCzechoslovak Mathematical Journal, 1995
- A characterization of the set of all shortest paths in a connected graphMathematica Bohemica, 1994
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969