#### Filter Results:

#### Publication Year

2001

2012

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

For any d ≥ 5 and k ≥ 3 we construct a family of Cayley graphs of degree d, diameter k, and order at least k((d − 3)/3) k. By comparison with other available results in this area we show that, for all sufficiently large d and k, our family gives the current largest known Cayley graphs of degree d and diameter k.

Let) 2 , (d C ,) 2 , (d AC , and) 2 , (d CC be the largest order of a Cayley graph of a group, an Abelian group, and a cyclic group, respectively, of diameter 2 and degree d. The currently known best lower bounds on these parameters are 2 /) 1 () 2 , (2 d d C for degrees 1 2 q d where q is an odd prime power,) 4)(8 / 3 () 2 , (2 d d AC where 2 4… (More)

We present an upper bound on the number of vertices in graphs of given degree and diameter 3 that arise as lifts of dipoles with voltage assignments in Abelian groups. Further, we construct a family of Cayley graphs of degree d = 3m − 1 and diameter k ≥ 3 of order km k. By comparison with other available results in this area we show that, for sufficiently… (More)

- ‹
- 1
- ›