Geodesic
The degree-diameter problem for circulant graphs of degree 8 and 9
Robert R. Lewis1
1Open University, UK
The electronic journal of combinatorics, Tome 21 (2014) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

This paper considers the degree-diameter problem for undirected circulant graphs. The focus is on extremal graphs of given (small) degree and arbitrary diameter. The published literature only covers graphs of up to degree 7. The approach used to establish the results for degree 6 and 7 has been extended successfully to degree 8 and 9. Candidate graphs are defined as functions of the diameter for both degree 8 and degree 9. They are proven to be extremal for small diameters. They establish new lower bounds for all greater diameters, and are conjectured to be extremal. The existence of the degree 8 solution is proved for all diameters. Finally some conjectures are made about solutions for circulant graphs of higher degree.
DOI : 10.37236/4279
Classification : 05C35, 05C12, 05C25
Mots-clés : degree-diameter, extremal, circulant graphs, abelian Cayley graphs

Robert R. Lewis  1

1 Open University, UK 
@article{10_37236_4279,
     author = {Robert R. Lewis},
     title = {The degree-diameter problem for circulant graphs of degree 8 and 9},
     journal = {The electronic journal of combinatorics},
     year = {2014},
     volume = {21},
     number = {4},
     doi = {10.37236/4279},
     zbl = {1305.05107},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/4279/}
}
TY  - JOUR
AU  - Robert R. Lewis
TI  - The degree-diameter problem for circulant graphs of degree 8 and 9
JO  - The electronic journal of combinatorics
PY  - 2014
VL  - 21
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/4279/
DO  - 10.37236/4279
ID  - 10_37236_4279
ER  - 
%0 Journal Article
%A Robert R. Lewis
%T The degree-diameter problem for circulant graphs of degree 8 and 9
%J The electronic journal of combinatorics
%D 2014
%V 21
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/4279/
%R 10.37236/4279
%F 10_37236_4279
Robert R. Lewis. The degree-diameter problem for circulant graphs of degree 8 and 9. The electronic journal of combinatorics, Tome 21 (2014) no. 4. doi: 10.37236/4279

Cité par Sources :