A Cayley graph Γ is said to be arc-transitive if its full automorphism group AutΓ is transitive on the arc set of Γ. In this paper we give a characterization of pentavalent arc-transitive Cayley graphs on a class of Frobenius groups with soluble vertex stabilizer
AbstractA characterization is given of a class of edge-transitive Cayley graphs, providing methods f...
A cycle decomposition of a graph ▫$Gamma$▫ is a set ▫$mathcal{C}$▫ of cycles of ▫$Gamma$▫ such that ...
It has long been known that there exist finite connected tetravalent arc-transitive graphs with arbi...
AbstractFor a positive integer s, a graph Γ is called s-arc transitive if its full automorphism grou...
AbstractA graph X, with a subgroup G of the automorphism group Aut(X) of X, is said to be (G,s)-tran...
AbstractBy definition, Cayley graphs are vertex-transitive, and graphs underlying regular or orienta...
AbstractA graph, with a group G of its automorphisms, is said to be (G,s)-transitive if G is transit...
A graph is 1-arc-regular if its full automorphism group acts regularly on the set of its arcs. In th...
For a positive integer s, a graph Gamma is called s-arc transitive if its full automorphism group Au...
AbstractA graph is 1-arc-regular if its full automorphism group acts regularly on the set of its arc...
AbstractThe classification of 2-arc-transitive Cayley graphs of cyclic groups, given in (J. Algebra....
A graph X is k-arc-transitive if its automorphism group acts transitively on the set of k-arcs of X....
AbstractA 2-arc in a graph X is a sequence of three distinct vertices of graph X where the first two...
A graph $X$ is {\em symmetric} if its automorphism group acts transitively on the arcs of $X$, and {...
Let G be a finite group, and let $1_G ∉ S ⊆ G$. A Cayley di-graph Γ = Cay(G,S) of G relative to S is...
AbstractA characterization is given of a class of edge-transitive Cayley graphs, providing methods f...
A cycle decomposition of a graph ▫$Gamma$▫ is a set ▫$mathcal{C}$▫ of cycles of ▫$Gamma$▫ such that ...
It has long been known that there exist finite connected tetravalent arc-transitive graphs with arbi...
AbstractFor a positive integer s, a graph Γ is called s-arc transitive if its full automorphism grou...
AbstractA graph X, with a subgroup G of the automorphism group Aut(X) of X, is said to be (G,s)-tran...
AbstractBy definition, Cayley graphs are vertex-transitive, and graphs underlying regular or orienta...
AbstractA graph, with a group G of its automorphisms, is said to be (G,s)-transitive if G is transit...
A graph is 1-arc-regular if its full automorphism group acts regularly on the set of its arcs. In th...
For a positive integer s, a graph Gamma is called s-arc transitive if its full automorphism group Au...
AbstractA graph is 1-arc-regular if its full automorphism group acts regularly on the set of its arc...
AbstractThe classification of 2-arc-transitive Cayley graphs of cyclic groups, given in (J. Algebra....
A graph X is k-arc-transitive if its automorphism group acts transitively on the set of k-arcs of X....
AbstractA 2-arc in a graph X is a sequence of three distinct vertices of graph X where the first two...
A graph $X$ is {\em symmetric} if its automorphism group acts transitively on the arcs of $X$, and {...
Let G be a finite group, and let $1_G ∉ S ⊆ G$. A Cayley di-graph Γ = Cay(G,S) of G relative to S is...
AbstractA characterization is given of a class of edge-transitive Cayley graphs, providing methods f...
A cycle decomposition of a graph ▫$Gamma$▫ is a set ▫$mathcal{C}$▫ of cycles of ▫$Gamma$▫ such that ...
It has long been known that there exist finite connected tetravalent arc-transitive graphs with arbi...
DOI
Add to ORKG