Tetravalent vertex-transitive graphs of order 4p

  • Authors:
  • Jin-Xin Zhou

  • Affiliations:
  • Department of Mathematics, Beijing Jiaotong University Beijing 100044, P. R. China

  • Venue:
  • Journal of Graph Theory
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

A graph is vertex-transitive if its automorphism group acts transitively on vertices of the graph. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this article, the tetravalent vertex-transitive non-Cayley graphs of order 4p are classified for each prime p. As a result, there are one sporadic and five infinite families of such graphs, of which the sporadic one has order 20, and one infinite family exists for every prime p3, two families exist if and only if p≡1 (mod 8) and the other two families exist if and only if p≡1 (mod 4). For each family there is a unique graph for a given order. © 2011 Wiley Periodicals, Inc. (Contract grant sponsor: National Natural Science Foundation of China; Contract grant number: 10901015; Contract grant sponsor: Fundamental Research Funds for the Central Universities; Contract grant numbers: 2011JBM127 and 2011JBZ012; Contract grant sponsor: Science and Technology Foundation of Beijing Jiaotong University; Contract grant number: 2008RC037.)