Symplectic graphs and their automorphisms

13 years 4 months ago

Download math.suda.edu.cn

The general symplectic graph Sp(2, q) is introduced. It is shown that Sp(2, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphisms are also determined.

Zhongming Tang, Zhe-xian Wan

Real-time Traffic

Chromatic Number | EJC 2006 | EJC 2007 | General Symplectic Graph | Graph Automorphisms |

claim paper

» Automorphic Decompositions of Graphs

» Complexity of Ring Morphism Problems

» Distinguishing geometric graphs

» Isometrically Embedded Graphs

» Binary codes from the line graph of the ncube

» A new family of locally 5arc transitive graphs

» Primitive 2factorizations of the complete graph

» Structural Detection of Symmetries in Boolean Functions

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	EJC
Authors	Zhongming Tang, Zhe-xian Wan

Comments (0)

Sciweavers

Symplectic graphs and their automorphisms

Chromatic Number | EJC 2006 | EJC 2007 | General Symplectic Graph | Graph Automorphisms |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers