Unitary graphs and classification of a family of symmetric graphs with complete quotients

preprint2015arXivOpen access

Abstract

A finite graph ΓΓ is called GG-symmetric if GG is a group of automorphisms of ΓΓ which is transitive on the set of ordered pairs of adjacent vertices of ΓΓ. We study a family of symmetric graphs, called the unitary graphs, whose vertices are flags of the Hermitian unital and whose adjacency relations are determined by certain elements of the underlying finite fields. Such graphs admit the unitary groups as groups of automorphisms, and they play a significant role in the classification of a family of symmetric graphs with complete quotients such that an associated incidence structure is a doubly point-transitive linear space. We give this classification in the paper and also investigate combinatorial properties of the unitary graphs.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.