Geodesic
Nonexistence of graphs with cyclic defect
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this note we consider graphs of maximum degree $\Delta$, diameter $D$ and order ${\rm M}(\Delta,D) - 2$, where ${\rm M}(\Delta,D)$ is the Moore bound, that is, graphs of defect 2. Delorme and Pineda-Villavicencio conjectured that such graphs do not exist for $D\geq 3$ if they have the so called 'cyclic defect'. Here we prove that this conjecture holds.
DOI : 10.37236/558
Classification : 05C38, 05C35, 05C75
Mots-clés : graphs with cyclic defect, Moore bound, defect, repeat 
@article{10_37236_558,
     author = {Mirka Miller},
     title = {Nonexistence of graphs with cyclic defect},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/558},
     zbl = {1218.05077},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/558/}
}
TY  - JOUR
AU  - Mirka Miller
TI  - Nonexistence of graphs with cyclic defect
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/558/
DO  - 10.37236/558
ID  - 10_37236_558
ER  - 
%0 Journal Article
%A Mirka Miller
%T Nonexistence of graphs with cyclic defect
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/558/
%R 10.37236/558
%F 10_37236_558
Mirka Miller. Nonexistence of graphs with cyclic defect. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/558

Cité par Sources :