Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-23T02:44:04.842Z Has data issue: false hasContentIssue false
  • English
  • Français

Classifying a family of symmetric graphs

Published online by Cambridge University Press:  17 April 2009

Sanming Zhou
Sanming Zhou
Affiliation:
Department of Mathematics and Statistics, The University of Western Australia, Perth, WA 6907, Australia, e-mail: [email protected] Department of Mathematics and Statistics, The University of Melbourne, Parkville, VIC 3010, Australia, e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let Γ be a G-symmetric graph admitting a nontrivial G-invariant partition ℬ of block size υ. For blocks B, C of ℬ adjacent in the quotient graph Γℬ, let k be the number of vertices in B adjacent to at least one vertex in C. In this paper we classify all possibilities for (Γ Γℬ, G) in the case where k = υ − 1 ≥ 2 and ℬ(α) = ℬ(β) for adjacent vertices α β of Γ where for a vertex of Γ, say γ ∈ B, ℬ(γ) denotes the set of blocks C such that γ is the only vertex in B not adjacent to any vertex in C.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 63 , Issue 2 , April 2001 , pp. 329 - 335
Copyright
Copyright © Australian Mathematical Society 2001

References

[1]Biggs, N.L., Algebraic graph theory, (Second edition) (Cambridge University Press, Cambridge, 1993).Google Scholar
[2]Cameron, P.J., ‘Finite permutation groups and finite simple groups’, Bull. London Math. Soc. 13 (1981), 1–22.Google Scholar
[3]Dixon, J.D. and Mortimer, B., Permutation groups (Springer-Verlag, Berlin, Heidelberg, New York, 1996).CrossRefGoogle Scholar
[4]Gardiner, A. and Praeger, C.E., ‘A geometrical approach to imprimitive graphs’, Proc. London Math. Soc. (3) 71 (1995), 524–546.CrossRefGoogle Scholar
[5]Gardiner, A., Praeger, C.E. and Zhou, S., ‘Cross ratio graphs’, Proc. London Math. Soc. (to appear).Google Scholar
[6]Kantor, W.M., ‘Homogeneous designs and geometric lattices’, J. Combin. Theory Ser. A 38 (1985), 66–74.CrossRefGoogle Scholar
[7]Li, C.H., Praeger, C.E. and Zhou, S., ‘A class of finite symmetric graphs with 2-arc transitive quotients’, Math. Proc. Cambridge Philos. Soc. 129 (2000), 19–34.Google Scholar
[8]Praeger, C.E., ‘Imprimitive symmetric graphs’, Ars Combin. 19A (1985), 149–163.Google Scholar
[9]Zhou, S., ‘Almost covers of 2-arc transitive graphs’, (submitted).Google Scholar
[10]Zhou, S., ‘Imprimitive symmetric graphs, 3-arc graphs and 1-designs’, Discrete Math. (to appear).Google Scholar
[11]Zhou, S., ‘Constructing a class of symmetric graphs’, (submitted).Google Scholar