Back to Search
Start Over
Semisymmetric Graphs of Order 2p3 with Valency p2.
- Source :
-
Algebra Colloquium . Jun2024, Vol. 31 Issue 2, p199-208. 10p. - Publication Year :
- 2024
-
Abstract
- A simple undirected regular graph is said to be semisymmetric if it is edge-transitive but not vertex-transitive. For a semisymmetric graph Γ of order 2 p 3 , p a prime, it is well known that Γ is bipartite with two biparts having equal size. The complete classification of such graphs has been given for the full automorphism group Aut (Γ) acting unfaithfully on at least one bipart of Γ , which shows that there is only one infinite family of such graphs with valency p 2. The graphs of this kind have been determined when Aut (Γ) acts faithfully and primitively on at least one bipart of Γ , and thus there is only one remaining case for classifying such graphs of valency p 2 , Aut (Γ) acting faithfully and imprimitively on both biparts of Γ , which is dealt with in this paper. As a result, there is only one infinite family of semisymmetric graphs of order 2 p 3 with valency p 2. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10053867
- Volume :
- 31
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Algebra Colloquium
- Publication Type :
- Academic Journal
- Accession number :
- 177519857
- Full Text :
- https://doi.org/10.1142/S1005386724000166