论文信息 - An upper bound for graphs of diameter 3 and given degree obtained as abelian lifts of dipoles

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

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.

Tomás Vetrík | T. Vetrík

[1] Brendan D. McKay,et al. A Note on Large Graphs of Diameter Two and Given Maximum Degree, , 1998, J. Comb. Theory, Ser. B.

[2] Jana Siagiová,et al. A Note on the McKay-Miller-Sira'n Graphs , 2001, J. Comb. Theory, Ser. B.

[3] J. Šiagiová. A Moore-like bound for graphs of diameter 2 and given degree, obtained as abelian lifts of dipoles. , 2002 .