论文信息 - Infinite Classes of Dihedral Snarks

Infinite Classes of Dihedral Snarks

Abstract.Flower snarks and Goldberg snarks are two infinite families of cyclically 5–edge–connected cubic graphs with girth at least five and chromatic index four. For any odd integer k, k > 3, there is a Flower snark, say Jk, of order 4k and a Goldberg snark, say Bk, of order 8k. We determine the automorphism groups of Jk and Bk for every k and prove that they are isomorphic to the dihedral group D4k of order 4k.

Beatrice Ruini | Carla Fiori | Carla Fiori | B. Ruini

[1] G. Sabidussi,et al. Graph symmetry : algebraic methods and applications , 1997 .

[2] Alberto Cavicchioli,et al. Special Classes of Snarks , 2003 .

[3] Eckhard Steffen,et al. Snarks and Reducibility , 1998, Ars Comb..

[4] Derek Allan Holton,et al. The Petersen graph , 1993, Australian mathematical society lecture series.

[5] Robin J. Wilson. Introduction to Graph Theory , 1974 .

[6] Robin J. Wilson,et al. Edge-colourings of graphs , 1977 .

[7] R. Isaacs. Infinite Families of Nontrivial Trivalent Graphs Which are not Tait Colorable , 1975 .

[8] Gareth A. Jones,et al. Automorphisms and regular embeddings of merged Johnson graphs , 2005, Eur. J. Comb..

[9] Mark K. Goldberg,et al. Construction of class 2 graphs with maximum vertex degree 3 , 1981, J. Comb. Theory, Ser. B.

[10] G. Szekeres,et al. Polyhedral decompositions of cubic graphs , 1973, Bulletin of the Australian Mathematical Society.

[11] Alberto Cavicchioli,et al. A survey on snarks and new results: Products, reducibility and a computer search , 1998 .

[12] L. Babai. Combinatorics: On the abstract group of automorphisms , 1981 .