scholarly journals Edge-transitive graphs and combinatorial designs

2019 ◽  
Vol 12 (8) ◽  
pp. 1329-1341
Author(s):  
Heather A. Newman ◽  
Hector Miranda ◽  
Adam Gregory ◽  
Darren A. Narayan
10.37236/4573 ◽  
2015 ◽  
Vol 22 (3) ◽  
Author(s):  
Cai Heng Li ◽  
Zai Ping Lu ◽  
Gai Xia Wang

We study the class of  edge-transitive graphs of square-free order and valency at most $k$. It is shown that, except for a few special families of graphs, only finitely many members in this class are basic (namely, not a normal multicover of another member). Using this result, we determine the automorphism groups of locally primitive arc-transitive graphs with square-free order.


2020 ◽  
Vol 179 (3) ◽  
pp. 651-671
Author(s):  
Daniel Figueiredo ◽  
Giulio Iacobelli ◽  
Seva Shneer

2010 ◽  
Vol 310 (17-18) ◽  
pp. 2273-2279 ◽  
Author(s):  
Yingzhi Tian ◽  
Jixiang Meng

2019 ◽  
Vol 162 ◽  
pp. 34-54 ◽  
Author(s):  
Daniel Král' ◽  
Taísa L. Martins ◽  
Péter Pál Pach ◽  
Marcin Wrochna

2009 ◽  
Vol 119 (5) ◽  
pp. 647-653
Author(s):  
Mehdi Alaeiyan ◽  
M. K. Hosseinipoor

Author(s):  
Brian Alspach ◽  
Dragan Marušič ◽  
Lewis Nowitz

AbstractAn infinite family of vertex-and edge-transitive, but not arc-transitive, graphs of degree 4 is constructed.


10.37236/94 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
Marko Boben ◽  
Štefko Miklavič ◽  
Primož Potočnik

A directed cycle $C$ of a graph is called $1\over k$-consistent if there exists an automorphism of the graph which acts as a $k$-step rotation of $C$. These cycles have previously been considered by several authors in the context of arc-transitive graphs. In this paper we extend these results to the case of graphs which are vertex-transitive, edge-transitive but not arc-transitive.


Sign in / Sign up

Export Citation Format

Share Document