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

Discussiones Mathematicae Graph Theory (2008)

- Volume: 28, Issue: 1, page 91-96
- ISSN: 2083-5892

## Access Full Article

top## Abstract

top## How to cite

topTomá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 -

## References

top- [1] B.D. McKay, M. Miller and J. Sirán, A note on large graphs of diameter two and given maximum degree, J. Combin. Theory (B) 74 (1998) 110-118, doi: 10.1006/jctb.1998.1828. Zbl0911.05031
- [2] J. Siagiová, A Moore-like bound for graphs of diameter 2 and given degree, obtained as Abelian lifts of dipoles, Acta Math. Univ. Comenianae 71 (2002) 157-161. Zbl1046.05023
- [3] J. Siagiová, A note on the McKay-Miller-Sirán graphs, J. Combin. Theory (B) 81 (2001) 205-208, doi: 10.1006/jctb.2000.2006. Zbl1024.05039

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.