Results 11 to 20 of about 38,382 (189)
Strongly regular edge-transitive graphs [PDF]
Ars Mathematica Contemporanea, 2009 In this paper, we examine the structure of vertex- and edge-transitive strongly regular graphs, using normal quotient reduction. We show that the irreducible graphs in this family have quasiprimitive automorphism groups, and prove (using the ...
Morris, Joy +2 more
core +5 more sources
Weakly Norming Graphs are Edge-Transitive [PDF]
Combinatorica, 2020 to appear in "Combinatorica"
Alexander Sidorenko
openalex +4 more sources
Classification of edge-transitive Nest graphs [PDF]
Graphs and Combinatorics, 2023 AbstractA finite simple graph $$\Gamma $$ Γ is called a Nest graph if it is regular of valency 6 and admits an automorphism with two orbits of the same length such that at least one of the subgraphs induced by these orbits is a cycle.
István Kovács
openalex +2 more sources
Semiregular automorphisms of edge-transitive graphs [PDF]
Journal of Algebraic Combinatorics, 2014 The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism, that is, a nontrivial automorphism whose cycles all have the same length. In this paper we investigate the existence of semiregular automorphisms of edge-transitive graphs.
Michael Giudici +2 more
openalex +3 more sources
Edge-transitive bi-Cayley graphs [PDF]
Journal of Combinatorial Theory, Series B, 2016 A graph $\G$ admitting a group $H$ of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a {\em bi-Cayley graph\/} over $H$. Such a graph $\G$ is called {\em normal\/} if $H$ is normal in the full automorphism group of $\G$, and {\em normal edge-transitive\/} if the normaliser of $H$ in the full automorphism group of $
Marston Conder +3 more
openalex +5 more sources
CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER 8p2 [PDF]
Proceedings - Mathematical Sciences, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mehdi Alaeiyan, Mohsen Ghasemi
+4 more sources
Recipes for edge-transitive tetravalent graphs
The Art of Discrete and Applied Mathematics, 2020 Summary: This paper presents all constructions known to the authors which result in tetravalent graphs whose symmetry groups are large enough to be transitive on the edges of the graph.
Primož Potočnik, Stephen E. Wilson
openalex +4 more sources
Finite normal edge-transitive Cayley graphs [PDF]
Bulletin of the Australian Mathematical Society, 1999 An approach to analysing the family of Cayley graphs for a finite group G is given which identifies normal edge-transitive Cayley graphs as a sub-family of central importance. These are the Cayley graphs for G for which a subgroup of automorphisms exists which both normalises G and acts transitively on edges. It is shown that, for a nontrivial group G,
Cheryl E. Praeger
openalex +2 more sources
Involve, a Journal of Mathematics, 2017 A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all connected edge-transitive graphs on less than or equal to $20$ vertices.
Newman, Heather A. +2 more
openaire +4 more sources
Edge-transitive token graphs as covers [PDF]
This paper uses the theory of covering graphs to characterize some of the edge-transitive graphs which can arise as token graphs.
Sergio Gerardo Gómez-Galicia +1 more
openalex +3 more sources