Download PDF - An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipolesAll rights reserved. Copyright exceptions and limitations apply

ArticleOriginal scientific text

Title

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

Authors 1

Affiliations

  1. Department of Mathematics, SvF, Slovak University of Technology, Bratislava, Slovakia

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.

Keywords

ENG
degree and diameter of a graph, dipole

Bibliography

  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.
  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.
  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.
Discussiones Mathematicae Graph Theory
2008/28/1
Export to PBN, Opens in new tab
Pages:
91-96
Main language of publication
English
Received
2006-09-29
Accepted
2007-02-13
Published
2008

DOI: 10.7151/dmgt.1393

Exact and natural sciences