Science in China Series A: Mathematics

, Volume 52, Issue 2, pp 361–380 | Cite as

Orthogonal graphs of characteristic 2 and their automorphisms

  • ZheXian Wan
  • Kai ZhouEmail author


The (singular) orthogonal graph O(2ν + δ, q) over a field with q elements and of characteristic 2 (where ν ⩾ 1, and δ = 0, 1 or 2) is introduced. When ν = 1, O(2 · 1, q), O(2 · 1 + 1, q) and O(2 · 1 + 2, q) are complete graphs with 2, q + 1 and q 2 + 1 vertices, respectively. When ν ⩾ 2, O(2ν + δ, q) is strongly regular and its parameters are computed. O(2ν + 1, q) is isomorphic to the symplectic graph Sp(2ν, q). The chromatic number of O(2ν + ν, q) except when δ = 0 and ν is odd is computed and the group of graph automorphisms of O(2ν + δ, q) is determined.


singular orthogonal graphs regularity chromatic number automorphisms 


05E15 05E30 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Wan Z. Geometry of Classical Groups over Finite Fields, 2nd ed. Beijing-New York: Science Press, 2002Google Scholar
  2. 2.
    Tang Z, Wan Z. Symplectic graphs and their automorphisms. European J Combin, 27: 38–50 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Godsil C, Royle G. Algebraic Graph Theory. Graduate Texts in Mathematics, Vol. 207. New York: Springer-Verlag, 2001Google Scholar
  4. 4.
    Hoffman A J. On eigenvalues and colorings of graphs. In: Graph Theory and its Applications. New York: Academic Press, 1970Google Scholar
  5. 5.
    Dye R H. Partitions and their stabilizers for line complexes and quadrics. Ann Mat Pura Appl, 114: 173–194 (1977)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Wan Z. Lectures on Finite Fields and Galois Rings. Singapore: World Scientific, 2003zbMATHGoogle Scholar

Copyright information

© Science in China Press and Springer-Verlag GmbH 2009

Authors and Affiliations

  1. 1.Academy of Mathematics and Systems ScienceChinese Academy of SciencesBeijingChina

Personalised recommendations