A Local Analysis of Imprimitive Symmetric Graphs
Sanming Zhou
The University of Melbourne Department of Mathematics and Statistics Parkville VIC 3010 Australia Parkville VIC 3010 Australia
DOI: 10.1007/s10801-005-4627-z
Abstract
Let \? be a G-symmetric graph admitting a nontrivial G-invariant partition B {\cal B} . Let \? B _{\cal B} be the quotient graph of \? with respect to B {\cal B} . For each block B ϵ B {\cal B} , the setwise stabiliser G B of B in G induces natural actions on B and on the neighbourhood \? B _{\cal B} ( B) of B in \? B _{\cal B} . Let G ( B) and G [ B] be respectively the kernels of these actions. In this paper we study certain “local actions" induced by G ( B) and G [ B], such as the action of G [ B] on B and the action of G ( B) on \? B _{\cal B} ( B), and their influence on the structure of \?.
Pages: 435–449
Keywords: keywords symmetric graph; arc-transitive graph; quotient graph; locally quasiprimitive graph
Full Text: PDF
References
1. N.L. Biggs, Algebraic Graph Theory, 2nd edn., Cambridge University Press, Cambridge, 1993.
2. J.D. Dixon and B. Morttimer, Permutation Groups, Springer, New York, 1996.
3. A. Gardiner and C.E. Praeger, “A geometrical approach to imprimitive graphs,” Proc. London Math. Soc.(3) 71 (1995), 524-546.
4. A. Gardiner and C.E. Praeger, Symmetric graphs with complete quotients, preprint, University of Western Australia.
5. M.A. Iranmanesh, C.E. Praeger, and S. Zhou, “Finite symmetric graphs with two-arc transitive quotients,” J. Combin. Theory (Series B) 94 (2005), 79-99.
6. C.H. Li, C.E. Praeger, A. Venkatesh, and S. Zhou, “Finite locally quasiprimitive graphs,” Discrete Math. 246 (2002), 197-218.
7. C.H. Li, C.E. Praeger, and S. Zhou, “A class of finite symmetric graphs with 2-arc transitive quotients,” Math. Proc. Camb. Phil. Soc. 129 (2000), 19-34.
8. C.E. Praeger, “Imprimitive symmetric graphs,” Ars Combin. 19A (1985), 149-163.
9. C.E. Praeger, “On automorphism groups of imprimitive symmetric graphs,” Ars Combin. 23A (1987), 207- 224.
10. C.E. Praeger, “Finite transitive permutation groups and finite vertex transitive graphs,” in Graph Symmetry G. Hahn and G. Sabidussi (Eds.), (Montreal, 1996, NATO Adv. Sci. Inst. Ser. C, Math. Phys. Sci., 497), Kluwer Academic Publishing, Dordrecht, 1997, pp. 277-318.
11. C.E. Praeger, “Finite quasiprimitive graphs, surveys in combinatorics,” London Math. Soc. Lecture Note Series 24 (1997), 65-85.
12. S. Zhou, “Imprimitive symmetric graphs, 3-arc graphs and 1-designs,” Discrete Math. 244 (2002), 521-537.
13. S. Zhou, “Constructing a class of symmetric graphs,” European J. Combin. 23 (2002), 741-760.
14. S. Zhou, “Symmetric graphs and flag graphs,” Monatshefte f\ddot ur Mathematik 139 (2003), 69-81.
15. S. Zhou, “Almost covers of 2-arc transitive graphs,” Combin. 24 (2004), 731-745.
2. J.D. Dixon and B. Morttimer, Permutation Groups, Springer, New York, 1996.
3. A. Gardiner and C.E. Praeger, “A geometrical approach to imprimitive graphs,” Proc. London Math. Soc.(3) 71 (1995), 524-546.
4. A. Gardiner and C.E. Praeger, Symmetric graphs with complete quotients, preprint, University of Western Australia.
5. M.A. Iranmanesh, C.E. Praeger, and S. Zhou, “Finite symmetric graphs with two-arc transitive quotients,” J. Combin. Theory (Series B) 94 (2005), 79-99.
6. C.H. Li, C.E. Praeger, A. Venkatesh, and S. Zhou, “Finite locally quasiprimitive graphs,” Discrete Math. 246 (2002), 197-218.
7. C.H. Li, C.E. Praeger, and S. Zhou, “A class of finite symmetric graphs with 2-arc transitive quotients,” Math. Proc. Camb. Phil. Soc. 129 (2000), 19-34.
8. C.E. Praeger, “Imprimitive symmetric graphs,” Ars Combin. 19A (1985), 149-163.
9. C.E. Praeger, “On automorphism groups of imprimitive symmetric graphs,” Ars Combin. 23A (1987), 207- 224.
10. C.E. Praeger, “Finite transitive permutation groups and finite vertex transitive graphs,” in Graph Symmetry G. Hahn and G. Sabidussi (Eds.), (Montreal, 1996, NATO Adv. Sci. Inst. Ser. C, Math. Phys. Sci., 497), Kluwer Academic Publishing, Dordrecht, 1997, pp. 277-318.
11. C.E. Praeger, “Finite quasiprimitive graphs, surveys in combinatorics,” London Math. Soc. Lecture Note Series 24 (1997), 65-85.
12. S. Zhou, “Imprimitive symmetric graphs, 3-arc graphs and 1-designs,” Discrete Math. 244 (2002), 521-537.
13. S. Zhou, “Constructing a class of symmetric graphs,” European J. Combin. 23 (2002), 741-760.
14. S. Zhou, “Symmetric graphs and flag graphs,” Monatshefte f\ddot ur Mathematik 139 (2003), 69-81.
15. S. Zhou, “Almost covers of 2-arc transitive graphs,” Combin. 24 (2004), 731-745.