AbstractLet φ be Euler's phi function. Let n be a square-free positive integer such that gcd(n,φ(n))=q, q a prime, and if p|n is prime, then q2∤(p−1). We prove that a vertex-transitive graph Γ of order n is isomorphic to a Cayley graph of order n if and only if Aut(Γ) contains a transitive solvable subgroup
AbstractLet G be a finite group and Cay(G, S) the Cayley graph of G with respect to S. A subset S is...
AbstractBy definition, Cayley graphs are vertex-transitive, and graphs underlying regular or orienta...
AbstractWe investigate Cayley graphs of semigroups and show that they sometimes enjoy properties ana...
AbstractLet φ be Euler's phi function. Let n be a square-free positive integer such that gcd(n,φ(n))...
AbstractMarus̆ic̆ has shown that every vertex-transitive graph of order p3 is isomorphic to a Cayley...
AbstractIn this paper, we prove several results on the Cayley isomorphism problem concerning undirec...
For a positive integer n, does there exist a vertex-transitive graph Γ on n vertices which is not a ...
AbstractMarušič (Ann. Discrete Math. 27 (1985) 115) proved that all vertex-transitive graphs of orde...
AbstractA graph X, with a subgroup G of the automorphism group Aut(X) of X, is said to be (G,s)-tran...
We study the Erdős- Sòs conjecture that states that ever graph of average degree greater than k-1 co...
AbstractThis paper completes the determination of all integers of the form pqr (where p, q, and r ar...
The first part of this dissertation deals with highly symmetrical combinatorial structures - vertex ...
AbstractThe isomorphism problem for Cayley graphs has been extensively investigated over the past 30...
Let G be a finite group, and let Cay(G, S) be a Cayley digraph of G. If, for all T subset of G, Cay(...
Abstract A graph is called edge-transitive if its full automorphism group acts transitively on its e...
AbstractLet G be a finite group and Cay(G, S) the Cayley graph of G with respect to S. A subset S is...
AbstractBy definition, Cayley graphs are vertex-transitive, and graphs underlying regular or orienta...
AbstractWe investigate Cayley graphs of semigroups and show that they sometimes enjoy properties ana...
AbstractLet φ be Euler's phi function. Let n be a square-free positive integer such that gcd(n,φ(n))...
AbstractMarus̆ic̆ has shown that every vertex-transitive graph of order p3 is isomorphic to a Cayley...
AbstractIn this paper, we prove several results on the Cayley isomorphism problem concerning undirec...
For a positive integer n, does there exist a vertex-transitive graph Γ on n vertices which is not a ...
AbstractMarušič (Ann. Discrete Math. 27 (1985) 115) proved that all vertex-transitive graphs of orde...
AbstractA graph X, with a subgroup G of the automorphism group Aut(X) of X, is said to be (G,s)-tran...
We study the Erdős- Sòs conjecture that states that ever graph of average degree greater than k-1 co...
AbstractThis paper completes the determination of all integers of the form pqr (where p, q, and r ar...
The first part of this dissertation deals with highly symmetrical combinatorial structures - vertex ...
AbstractThe isomorphism problem for Cayley graphs has been extensively investigated over the past 30...
Let G be a finite group, and let Cay(G, S) be a Cayley digraph of G. If, for all T subset of G, Cay(...
Abstract A graph is called edge-transitive if its full automorphism group acts transitively on its e...
AbstractLet G be a finite group and Cay(G, S) the Cayley graph of G with respect to S. A subset S is...
AbstractBy definition, Cayley graphs are vertex-transitive, and graphs underlying regular or orienta...
AbstractWe investigate Cayley graphs of semigroups and show that they sometimes enjoy properties ana...
DOI
Add to ORKG