An algebraic characterization of geodetic graphs

Nebeský, Ladislav. "An algebraic characterization of geodetic graphs." Czechoslovak Mathematical Journal 48.4 (1998): 701-710. <http://eudml.org/doc/30448>.

@article{Nebeský1998,
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\in E(G)$ if and only if $u\ne v$, $u * v=v$ and $v*u=u$ for any $u$, $v\in V(G)$. In the paper it is proved that a connected graph $G$ is geodetic if and only if there exists a binary operation associated with $G$ which fulfils a certain set of four axioms. (This characterization is obtained as an immediate consequence of a stronger result proved in the paper).},
author = {Nebeský, Ladislav},
journal = {Czechoslovak Mathematical Journal},
keywords = {geodetic graph; binary operation; connected graph},
language = {eng},
number = {4},
pages = {701-710},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {An algebraic characterization of geodetic graphs},
url = {http://eudml.org/doc/30448},
volume = {48},
year = {1998},
}

TY - JOUR
AU - Nebeský, Ladislav
TI - An algebraic characterization of geodetic graphs
JO - Czechoslovak Mathematical Journal
PY - 1998
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 48
IS - 4
SP - 701
EP - 710
AB - 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\in E(G)$ if and only if $u\ne v$, $u * v=v$ and $v*u=u$ for any $u$, $v\in V(G)$. In the paper it is proved that a connected graph $G$ is geodetic if and only if there exists a binary operation associated with $G$ which fulfils a certain set of four axioms. (This characterization is obtained as an immediate consequence of a stronger result proved in the paper).
LA - eng
KW - geodetic graph; binary operation; connected graph
UR - http://eudml.org/doc/30448
ER -