scholarly journals Symmetric graphs of valency seven and their basic normal quotient graphs

2021 ◽  
Vol 19 (1) ◽  
pp. 735-746
Author(s):  
Jiangmin Pan ◽  
Junjie Huang ◽  
Chao Wang

Abstract We characterize seven valent symmetric graphs of order 2 p q n 2p{q}^{n} with p < q p\lt q odd primes, extending a few previous results. Moreover, a consequence partially generalizes the result of Conder, Li and Potočnik [On the orders of arc-transitive graphs, J. Algebra 421 (2015), 167–186].

10.37236/4842 ◽  
2015 ◽  
Vol 22 (3) ◽  
Author(s):  
Joy Morris ◽  
Pablo Spiga ◽  
Gabriel Verret

We characterise connected cubic graphs admitting a vertex-transitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a semiregular subgroup of maximum order in a vertex-transitive group of automorphisms of a connected cubic graph grows with the order of the graph.


2008 ◽  
Vol 77 (2) ◽  
pp. 315-323 ◽  
Author(s):  
MEHDI ALAEIYAN ◽  
MOHSEN GHASEMI

AbstractA simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. Let p be a prime. It was shown by Folkman [J. Folkman, ‘Regular line-symmetric graphs’, J. Combin. Theory3 (1967), 215–232] that a regular edge-transitive graph of order 2p or 2p2 is necessarily vertex-transitive. In this paper an extension of his result in the case of cubic graphs is given. It is proved that every cubic edge-transitive graph of order 8p2 is vertex-transitive.


2006 ◽  
Vol 9 (5) ◽  
Author(s):  
Michael Giudici ◽  
Cai Heng Li ◽  
Cheryl E Praeger

2021 ◽  
Vol 407 ◽  
pp. 126334
Author(s):  
Jing Jian Li ◽  
Jing Yang ◽  
Ran Ju ◽  
Hongping Ma

2008 ◽  
Vol 15 (03) ◽  
pp. 379-390 ◽  
Author(s):  
Xuesong Ma ◽  
Ruji Wang

Let X be a simple undirected connected trivalent graph. Then X is said to be a trivalent non-symmetric graph of type (II) if its automorphism group A = Aut (X) acts transitively on the vertices and the vertex-stabilizer Av of any vertex v has two orbits on the neighborhood of v. In this paper, such graphs of order at most 150 with the basic cycles of prime length are investigated, and a classification is given for such graphs which are non-Cayley graphs, whose block graphs induced by the basic cycles are non-bipartite graphs.


Sign in / Sign up

Export Citation Format

Share Document