AbstractIn this paper the automorphism groups of connected cubic Cayley graphs of order 2pq for distinct odd primes p and q are determined. As an application, all connected cubic non-symmetric Cayley graphs of order 2pq are classified and this, together with classifications of connected cubic symmetric graphs and vertex-transitive non-Cayley graphs of order 2pq given by the last two authors, completes a classification of connected cubic vertex-transitive graphs of order 2pq
When dealing with symmetry properties of mathematical objects, one of the fundamental questions is t...
Let p be an odd prime. In this paper we prove that all tetravalent connected Cayley graphs of order ...
A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this pape...
AbstractA Cayley graph Cay(G,S) on a group G is said to be normal if the right regular representatio...
An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs i...
AbstractMarus̆ic̆ has shown that every vertex-transitive graph of order p3 is isomorphic to a Cayley...
Let G be a group generated by elements x and y such that x2 = yp = e, where p is an odd prime. Let X...
AbstractMarušič (Ann. Discrete Math. 27 (1985) 115) proved that all vertex-transitive graphs of orde...
AbstractLet k and p be odd primes with k < p. All vertex-primitive graphs of order kp are classified...
For a positive integer n, does there exist a vertex-transitive graph Γ on n vertices which is not a ...
Abstract. A graph is symmetric, if its automorphism group is transitive on the set of its arcs. In t...
A non-Cayley number is an integer n for which there exists a vertex-transitive graph on n vertices w...
AbstractIn this short paper, we give a positive answer to a question of C. D. Godsil (1983,Europ. J....
The first part of this dissertation deals with highly symmetrical combinatorial structures - vertex ...
Abstract A graph is called edge-transitive if its full automorphism group acts transitively on its e...
When dealing with symmetry properties of mathematical objects, one of the fundamental questions is t...
Let p be an odd prime. In this paper we prove that all tetravalent connected Cayley graphs of order ...
A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this pape...
AbstractA Cayley graph Cay(G,S) on a group G is said to be normal if the right regular representatio...
An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs i...
AbstractMarus̆ic̆ has shown that every vertex-transitive graph of order p3 is isomorphic to a Cayley...
Let G be a group generated by elements x and y such that x2 = yp = e, where p is an odd prime. Let X...
AbstractMarušič (Ann. Discrete Math. 27 (1985) 115) proved that all vertex-transitive graphs of orde...
AbstractLet k and p be odd primes with k < p. All vertex-primitive graphs of order kp are classified...
For a positive integer n, does there exist a vertex-transitive graph Γ on n vertices which is not a ...
Abstract. A graph is symmetric, if its automorphism group is transitive on the set of its arcs. In t...
A non-Cayley number is an integer n for which there exists a vertex-transitive graph on n vertices w...
AbstractIn this short paper, we give a positive answer to a question of C. D. Godsil (1983,Europ. J....
The first part of this dissertation deals with highly symmetrical combinatorial structures - vertex ...
Abstract A graph is called edge-transitive if its full automorphism group acts transitively on its e...
When dealing with symmetry properties of mathematical objects, one of the fundamental questions is t...
Let p be an odd prime. In this paper we prove that all tetravalent connected Cayley graphs of order ...
A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this pape...
DOI
Add to ORKG