Orthogonal graphs of characteristic 2 and their automorphisms

查看全文 作　　者：WAN [1]ZheXian;ZHOU [1]Kai

机构地区：[1]Academy of Mathematics and Systems Science,Chinese Academy of Sciences,Beijing 100190,China

出　　处：《Science China Mathematics》索引2009年第52卷第2期,共20页

基　　金：supported by National Natural Science Foundation of China (Grant No. 10731070);Major State Basic Research Development Program of China (Grant No. 2004CB318000) 摘　　要：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 q2 + 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

相关文献

参考文献（7）
引证文献（3）
耦合文献（0）

参考文献(7)

引证文献(3)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

Orthogonal graphs of characteristic 2 and their automorphisms

参考文献(7)

引证文献(3)

用户提示