An infinite family of cubic edge- but not vertex-transitive graphs

Discrete Mathematics

Volumn 280, Issue 1-3, 2004, Pages 133-148

  Malnič, Aleksander ^a   Marušič, Dragan ^a   Potočnik, Primož ^a   Wang, Changqun ^b  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

^b ZHENGZHOU UNIVERSITY   (China)

Author keywords

Covering protection; Edge transitive graph; Gray graph; Lifting automorphisms; Semisymmetric graph

Indexed keywords

MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; THEOREM PROVING;

COVERING PROTECTION; EDGE-TRANSITIVE GRAPHS; LIFTING AUTOMORPHISMS;

GRAPH THEORY;

EID: 1642281601     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2003.07.004     Document Type: Article

References (20)

1. Bouwer I.Z. An edge but not vertex transitive cubic graph. Bull. Can. Math. Soc. 11:1968;533-535.
2. Bouwer I.Z. On edge but not vertex transitive regular graphs. J. Combin. Theory B. 12:1972;32-40.
3. I.Z. Bouwer (Ed.), The Foster Census, Charles Babbage Research Centre, Winnipeg, 1988.
4. Dixon J.D., Mortimer B. Permutation Groups. 1996;Springer, New York.
5. Folkman J. Regular line-symmetric graphs. J. Combin. Theory. 3:1967;215-232.
6. Goldschmidt D. Automorphisms of trivalent graphs. Ann. of Math. 111:1980;377-406.
7. Gorenstein D. Finite Groups. 1968;Harper and Row, New York.
8. Gross J.L., Tucker T.W. Topological Graph Theory. 1987;Wiley-Interscience, New York.
9. M.E. Iofinova, A.A. Ivanov, Biprimitive cubic graphs, investigations in algebraic theory of combinatorial objects, Proceedings of the Seminar, Institute for System Studies, Moscow, 1985, Kluwer Academic Publishers, London, 1994, pp. 459-472.
10. Ivanov A.V. On edge but not vertex transitive regular graphs. Ann. Discrete Math. 34:1987;273-286.
11. Klin M.H. On edge but not vertex transitive graphs. Coll. Math. Soc. J. Bolyai (Algebraic Methods in Graph Theory, Szeged, 1978). 25:1981;399-403.
12. Lazebnik F., Viglione R. An infinite series of regular edge- but not vertex-transitive graphs. J. Graph Theory. 41:2002;249-258.
13. 3 Discrete Math. 274:2004;187-198.
14. Malnič A., Nedela R., Škoviera M. Lifting graph automorphisms by voltage assignments. European J. Combin. 21:2000;927-947.
15. Marušič D., Pisanski T. The Gray graph revisited. J. Graph Theory. 35:2000;1-7.
16. Marušič D., Potočnik P. Semisymmetry of generalized Folkman graphs. European J. Combin. 22:2001;333-349.
17. Škoviera M. A contribution to the theory of voltage graphs. Discrete Math. 61:1986;281-292.
18. Tutte W.T. A family of cubical graphs. Proc. Cambridge Philos. Soc. 43:1948;459-474.
19. Wielandt H. Finite Permutation Groups. 1964;Academic Press, New York.
20. Wilson S. A worthy family of semisymmetric graphs. Discrete Math. 271:2003;283-294.