On solvable groups and circulant graphs
Solvable graphs are defined to be graphs whose automorphism group contains a solvable subgroup. A circulant graph of order \(n\) has an automorphism group which contains an \(n\)-cycle. In this paper every vertex-transitive graph \(\Gamma\) of order \(n\) with \(\text{gcd}(n,\varphi(n))= 1\) is proved to be isomorphic to a circulant graph of order \(n\) if and only if \(\Gamma\) is a solvable graph. This result generalizes an analogous theorem of Marušič which is restricted to the case that \(n= pq\) is the product of two distinct prime numbers. As a corollary, every vertex-transitive graph of order \(n\) is stated to be isomorphic to a Cayley graph of order \(n\) if and only if every vertex-transitive graph of order \(n\) is solvable.
- On solvable groups and Cayley graphs
- On the soluble graph of a finite group
- Solvable graphs of finite groups
- On the Soluble Graph of a Finite Simple Group
- Solvable conjugacy class graph of groups
- On solvable groups
- On the character degree graph of solvable groups
- A graph related to conjugacy classes of solvable groups
- Solvable groups and loops
- A classification of symmetric graphs of order 3p
- Characterizing vertex-transitivepq-graphs with an imprimitive automorphism subgroup
- scientific article; zbMATH DE number 3849262 (Why is no real title available?)
- scientific article; zbMATH DE number 4089584 (Why is no real title available?)
- scientific article; zbMATH DE number 558656 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- Isomorphism of circulant graphs and digraphs
- Isomorphism problem for Cayley graphs of \(\mathbb{Z}^ 3_ p\)
- Isomorphism problem for relational structures with a cyclic automorphism
- On weakly symmetric graphs of order twice a prime
- Symmetric graphs of order a product of two distinct primes
- Vertex-primitive graphs of order a product of two distinct primes
- On the Soluble Graph of a Finite Simple Group
- The cyclomatic number of connected graphs without solvable orbits
- On semiregular elements of solvable groups.
- The swap graph of the finite soluble groups
- Cayley numbers with arbitrarily many distinct prime factors
- Cayley graphs of more than one abelian group
- Minimal normal subgroups of transitive permutation groups of square-free degree
- On the number of closed walks in vertex-transitive graphs
- On solvable groups and Cayley graphs
This page was built for publication: On solvable groups and circulant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587909)
