Geodesic
A note on the edge-connectivity of cages
The electronic journal of combinatorics, Tome 10 (2003)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A $(k;g)$-graph is a $k$-regular graph with girth $g$. A $(k;g)$-cage is a $(k;g)$-graph with the smallest possible number of vertices. In this paper we prove that $(k;g)$-cages are $k$-edge-connected if $k \geq 3$ and $g$ is odd.
DOI : 10.37236/1742
Classification : 05C35, 05C40
Mots-clés : girth, \((k, g)\)-cage 
@article{10_37236_1742,
     author = {Ping Wang and Baoguang Xu and Jianfang Wang},
     title = {A note on the edge-connectivity of cages},
     journal = {The electronic journal of combinatorics},
     year = {2003},
     volume = {10},
     doi = {10.37236/1742},
     zbl = {1016.05047},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1742/}
}
TY  - JOUR
AU  - Ping Wang
AU  - Baoguang Xu
AU  - Jianfang Wang
TI  - A note on the edge-connectivity of cages
JO  - The electronic journal of combinatorics
PY  - 2003
VL  - 10
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1742/
DO  - 10.37236/1742
ID  - 10_37236_1742
ER  - 
%0 Journal Article
%A Ping Wang
%A Baoguang Xu
%A Jianfang Wang
%T A note on the edge-connectivity of cages
%J The electronic journal of combinatorics
%D 2003
%V 10
%U http://geodesic.mathdoc.fr/articles/10.37236/1742/
%R 10.37236/1742
%F 10_37236_1742
Ping Wang; Baoguang Xu; Jianfang Wang. A note on the edge-connectivity of cages. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1742

Cité par Sources :