Diameter 2 Cayley graphs of dihedral groups

被引：5

作者：

Erskine, Grahame ^{[1
]}

机构：

[1] Open Univ, Dept Math & Stat, Milton Keynes MK7 6AA, Bucks, England

来源：

DISCRETE MATHEMATICS | 2015年 / 338卷 / 06期

关键词：

Degree-diameter problem; Cayley graph; Dihedral group;

D O I：

10.1016/j.disc.2015.01.023

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lower bounds on the maximum number of vertices of such a graph with diameter 2 and degree d. We completely determine the asymptotic behaviour of this class of graphs by showing that both limits are asymptotically d(2)/2. (C) 2015 Elsevier B.V. All rights reserved.

引用

页码：1022 / 1024

页数：3

共 6 条

[1] Cayley graphs of diameter two and any degree with order half of the Moore bound [J].

Abas, Marcel .

DISCRETE APPLIED MATHEMATICS, 2014, 173 :1-7

[2] The difference between consecutive primes, II [J].

Baker, RC ;

Harman, G ;

Pintz, J .

PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 2001, 83 :532-562

[3] Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups [J].

Macbeth, Heather ;

Siagiova, Jana ;

Siran, Jozef .

DISCRETE MATHEMATICS, 2012, 312 (01) :94-99

[4]

Miller M., 2013, ELECT J COMBIN

[5] Approaching the Moore bound for diameter two by Cayley graphs [J].

Siagiova, Jana ;

Siran, Jozef .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 2012, 102 (02) :470-473

[6]

Siran J., 2011, INT WORKSH OPT NETW, P347

← 1 →