Geodesic
Pentagon-Generated Trivalent Graphs with Girth 5
Canadian journal of mathematics, Tome 23 (1971) no. 1, pp. 36-47

Voir la notice de l'article provenant de la source Cambridge University Press

The terminology of [1] will be assumed in what follows. Let Pb(G) stand for the set of pentagons in the graph G. Call a graph pentagongenerated when it is the union of its contained pentagons. Let P5,3 be the class of connected trivalent pentagon-generated graphs with girth 5. These graphs form a family including the Petersen graph and the graph of the dodecahedron. They are studied here and completely classified in terms of a decomposition which all but some specifically determined indecomposable graphs admit.Assume henceforth that H ∈ P5,3. Let Ek(H) be the set of edges in exactly k ∈ 0 pentagons of H. Clearly Ek(H) = 0 if k ≠ 1, 2, 3, 4 and |E1(H) ∩ E(P)r ≦ 2, for all P ∈ P5(H). P ∈ P5(H) is singular when |E1(H) ∩ E(P)r = 2,. 
Robertson, Neil. Pentagon-Generated Trivalent Graphs with Girth 5. Canadian journal of mathematics, Tome 23 (1971) no. 1, pp. 36-47. doi: 10.4153/CJM-1971-004-0
@article{10_4153_CJM_1971_004_0,
     author = {Robertson, Neil},
     title = {Pentagon-Generated {Trivalent} {Graphs} with {Girth} 5},
     journal = {Canadian journal of mathematics},
     pages = {36--47},
     year = {1971},
     volume = {23},
     number = {1},
     doi = {10.4153/CJM-1971-004-0},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1971-004-0/}
}
TY  - JOUR
AU  - Robertson, Neil
TI  - Pentagon-Generated Trivalent Graphs with Girth 5
JO  - Canadian journal of mathematics
PY  - 1971
SP  - 36
EP  - 47
VL  - 23
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1971-004-0/
DO  - 10.4153/CJM-1971-004-0
ID  - 10_4153_CJM_1971_004_0
ER  - 
%0 Journal Article
%A Robertson, Neil
%T Pentagon-Generated Trivalent Graphs with Girth 5
%J Canadian journal of mathematics
%D 1971
%P 36-47
%V 23
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1971-004-0/
%R 10.4153/CJM-1971-004-0
%F 10_4153_CJM_1971_004_0

[1] 1. Tutte, W. T., Connectivity in graphs, Mathematical Expositions, No. 15 (Univ. Toronto Press, Toronto, Ontario; Oxford Univ. Press, London, 1966). Google Scholar | DOI

Cité par Sources :