Cubic Vertex-Transitive Non-Cayley Graphs of Order 8p

@article{Zhou2012CubicVN,
  title={Cubic Vertex-Transitive Non-Cayley Graphs of Order 8p},
  author={Jin-Xin Zhou and Yan-Quan Feng},
  journal={Electr. J. Comb.},
  year={2012},
  volume={19},
  pages={P53}
}
A graph is vertex-transitive if its automorphism group acts transitively on its vertices. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper, the cubic vertextransitive non-Cayley graphs of order 8p are classified for each prime p. It follows from this classification that there are two sporadic and two infinite families of such graphs, of which the sporadic ones have order 56, one infinite family exists for… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 28 references

The Magma Algebra System I: The User Language

J. Symb. Comput. • 1997
View 3 Excerpts
Highly Influenced

Tetravalent vertex-transitive graphs of order 4p

Journal of Graph Theory • 2012
View 1 Excerpt

Cubic vertex-transitive graphs of order 4p (Chinese)

J.-X. Zhou
J. Sys. Sci. & Math. Sci. 28 • 2008
View 2 Excerpts

On vertex-transitive non-Cayley graphs of square-free order

C. H. Li, A. Seress
Designs, Codes and Cryptography 34 • 2005
View 1 Excerpt

Trivalent symmetric graphs on up to 768 vertices

M.D.E. Conder, P. Dobcsányi
J. Combin. Math. Combin. Comput. 40 • 2002
View 2 Excerpts

Similar Papers

Loading similar papers…