A construction for infinite families of semisymmetric graphs revealing their full automorphism group

preprint2013arXivOpen access

Abstract

We give a general construction leading to different non-isomorphic families $Γ_{n,q}(\K)$ of connected qq-regular semisymmetric graphs of order 2qn+12q^{n+1} embedded in $\PG(n+1,q)$, for a prime power q=phq=p^h, using the linear representation of a particular point set $\K$ of size qq contained in a hyperplane of $\PG(n+1,q)$. We show that, when $\K$ is a normal rational curve with one point removed, the graphs $Γ_{n,q}(\K)$ are isomorphic to the graphs constructed for qq prime in [9] and to the graphs constructed for q=phq=p^h in [20]. These graphs were known to be semisymmetric but their full automorphism group was up to now unknown. For q≥n+3q\geq n+3 or q=p=n+2q=p=n+2, n≥2n\geq 2, we obtain their full automorphism group from our construction by showing that, for an arc $\K$, every automorphism of $Γ_{n,q}(\K)$ is induced by a collineation of the ambient space $\PG(n+1,q)$. We also give some other examples of semisymmetric graphs $Γ_{n,q}(\K)$ for which not every automorphism is induced by a collineation of their ambient space.

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.