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

Authors:
Massimo Giulietti;Stefano Marcugini;Fernanda Pambianco;Sanming Zhou
Affiliations:
Dipartimento di Matematica e Informatica, Università di Perugia, Perugia, Italy 06128;Dipartimento di Matematica e Informatica, Università di Perugia, Perugia, Italy 06128;Dipartimento di Matematica e Informatica, Università di Perugia, Perugia, Italy 06128;Department of Mathematics and Statistics, The University of Melbourne, Parkville, Australia 3010
Venue:
Journal of Algebraic Combinatorics: An International Journal
Year:
2013

Citing 8
Cited 0

Design theory

Design theory
The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Finite locally-quasiprimitive graphs

Discrete Mathematics
Imprimitive symmetric graphs, 3-arc graphs and 1-designs

Discrete Mathematics - Algebraic and topological methods in graph theory
Constructing a class of symmetric graphs

European Journal of Combinatorics
Finite symmetric graphs with two-arc transitive quotients

Journal of Combinatorial Theory Series B
Finite symmetric graphs with two-arc transitive quotients II

Journal of Graph Theory
Almost covers of 2-arc transitive graphs

Combinatorica

Quantified Score

Hi-index	0.00

Visualization

Abstract

A finite graph Γ is called G-symmetric if G 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 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.