An infinite series of regular edge- but not vertex-transitive graphs

Journal of Graph Theory

Volumn 41, Issue 4, 2002, Pages 249-258

  Lazebnik, Felix ^a   Viglione, Raymond ^a  

^a UNIVERSITY OF DELAWARE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036904625     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.10064     Document Type: Article

References (21)

1. 1 I. Z. Bouwer, An edge but not vertex transitive cubic graph, Canad Math Bull 11 ( 1968), 533–535.
2. 2 I. Z. Bouwer, On edge but not vertex transitive regular graphs, J Combin Theory Ser B 12 ( 1972), 32–40.
3. 3 S. F. Du, Construction of semisymmetric graphs, Graph Theory Notes of New York XXIX, 1995.
4. 4 S. F. Du and D. Marušič, An infinite family of biprimitive semisymmetric graphs, J Graph Theory 32 (3) ( 1999), 217–228.
5. 5 S. F. Du and D. Marušič, Biprimitive graphs of smallest order, J Algebraic Combin 9 (2) ( 1999), 151–156.
6. 6 S. F. Du and M. Y. Xu, A classification of semisymmetric graphs of order 2pq, Comm Algebra 28 (6) ( 2000), 2685–2715.
7. 7 J. Folkman, Regular line‐symmetric graphs, J Combin Theory, 3 ( 1967), 215–232.
8. 8 M. E. Iofinova and A. A. Ivanov, Biprimitive cubic graphs (Russian), in Investigation in Algebraic Theory of Combinatorial Objects, Proceedings of the seminar, Institute for System Studies, Moscow, 1985, 124–134.
9. 9 A. V. Ivanov, On edge but not vertex transitive regular graphs, Annals of Discrete Mathematics 34 ( 1987) 273–286.
10. 10 M. H. Klin, On edge but not vertex transitive regular graphs, L. Lovasz et al. (Editors), Algebraic methods in graph theory, Szeged 1978, Coloq Math Soc J Bolyai 25, North‐Holland, Amsterdam, 1981, 399–403.
11. 11 F. Lazebnik and V. A. Ustimenko, New examples of graphs without small cycles and of large size, Europ J Combinatorics 14 ( 1993), 445–460.
12. 12 F. Lazebnik, V. A. Ustimenko, and A. J. Woldar, New constructions of bipartite graphs on m, n vertices with many edges and without small cycles, J Combin Theory Ser B 61 (1) ( 1994), 111–117.
13. 13 F. Lazebnik and A. J. Woldar, General properties of families of graphs defined by some systems of equations, J Graph Theory 38,( 2001), 65–86.
14. 14 A. Malnič, D. Marušič, and C. Wang, Cubic semisymmetric graphs of order 2 p 3, submitted.
15. 15 A. Malnič, D. Marušič, and C. Wang, Semisymmetry of cyclic covers of K 3,3, in preparation.
16. 16 D. Marušič, Constructing cubic edge‐but not vertex‐transitive graphs, J Graph Theory 35 (2) ( 2000), 152–160.
17. 17 D. Marušič and T. Pisanski, The Gray graph revisited, J Graph Theory 35 (1) ( 2000), 1–7.
18. 18 D. Marušič and P. Potočnik, Semisymmetry of generalized Folkman graphs, Europ J Combinatorics 22 (3) ( 2001), 333–349.
19. 19 V. K. Titov, On symmetry in the graphs (Russian), Voprocy Kibernetiki (15), Proceedings of the II All Union Seminar on Combinatorial Mathematics, Part 2, Nauka, Moscow, 1975, 76–109.
20. 20 R. Viglione, Properties of some algebraically defined graphs, Ph.D. Thesis, University of Delaware, 2002.
21. 21 R. Wenger, Extremal graphs with no C 4, C 6, or C 10 's, J Combin Theory Ser B 52 ( 1991), 113–116.