Constructing cubic edge- but not vertex-transitive graphs

Journal of Graph Theory

Volumn 35, Issue 2, 2000, Pages 152-160

  Marušič, Dragan ^a  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

Cubic graph; Edge transitive; Graph; Line graph; Vertex transitive

Indexed keywords

EID: 0034415397     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0118(200010)35:2<152::AID-JGT7>3.0.CO;2-I     Document Type: Article

References (11)

1. I. Z. Bouwer, An edge but not vertex transitive cubic graph, Bull Can Math Soc 11 (1968), 533-535.
2. I. Z. Bouwer, On edge but not vertex transitive regular graphs, J Combin Theory B 12 (1972), 32-40.
3. P. Cameron, Finite permutation groups and finite simple groups, Bull London Math Soc 13 (1981), 1-22.
4. C. Godsil, On the full automorphism group of Cayley graphs, Combinatorica 1 (1981), 143-156.
5. J. D. Dixon and B. Mortimer, "Permutation groups", Springer-Verlag, New York, 1996.
6. S. F. Du, Construction of semisymmetric graphs, Graph Theory Notes of New York XXIX (1995), 148-149.
7. J. Folkman, Regular line-symmetric graphs, J Combin Theory 3 (1967), 215-232.
8. M. E. Iofinova and 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.
9. A. V. Ivanov, On edge but not vertex transitive regular graphs, Ann Discrete Math 34 (1987), 273-286.
10. M. H. Klin, On edge but not vertex transitive graphs, Coll Math Soc J Bolyai, (25. Algebraic Methods in Graph Theory, Szeged, 1978), Budapest, 1981, 399-403.
11. H. Wielandt, Finite Permutation Groups, Academic Press, New York, 1964.