An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles

Tomás Vetrík. "An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles." Discussiones Mathematicae Graph Theory 28.1 (2008): 91-96. <http://eudml.org/doc/270748>.

@article{TomásVetrík2008,
abstract = {We derive an upper bound on the number of vertices in graphs of diameter 3 and given degree arising from Abelian lifts of dipoles with loops and multiple edges.},
author = {Tomás Vetrík},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {degree and diameter of a graph; dipole; diameter; degree; multiple edges; Abelian lift},
language = {eng},
number = {1},
pages = {91-96},
title = {An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles},
url = {http://eudml.org/doc/270748},
volume = {28},
year = {2008},
}

TY - JOUR
AU - Tomás Vetrík
TI - An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles
JO - Discussiones Mathematicae Graph Theory
PY - 2008
VL - 28
IS - 1
SP - 91
EP - 96
AB - We derive an upper bound on the number of vertices in graphs of diameter 3 and given degree arising from Abelian lifts of dipoles with loops and multiple edges.
LA - eng
KW - degree and diameter of a graph; dipole; diameter; degree; multiple edges; Abelian lift
UR - http://eudml.org/doc/270748
ER -