Abstract
AbstractA connected graph of order n admitting a semiregular automorphism of order n/k is called a k-multicirculant. Highly symmetric multicirculants of small valency have been extensively studied, and several classification results exist for cubic vertex- and arc-transitive multicirculants. In this paper, we study the broader class of cubic vertex-transitive graphs of order n admitting an automorphism of order n/3 or larger that may not be semiregular. In particular, we show that any such graph is either a k-multicirculant for some $$k \le 3$$
k
≤
3
, or it belongs to an infinite family of graphs of girth 6.
Funder
Javna Agencija za Raziskovalno Dejavnost RS
Publisher
Springer Science and Business Media LLC
Reference32 articles.
1. Arezoomand, M., Abdollahi, A., Spiga, P.: On problems concerning fixed-point-free permutations and on the polycirculant conjecture - a survey. Trans. Comb. 8, 15–40 (2019)
2. Barbieri, M., Grazian, V., Spiga, P.: On the order of semiregular automorphisms of cubic vertex-transitive graphs. arXiv:2302.00034
3. Boben, M., Pisanski, T., Žitnik, A.: I-graphs and the corresponding configurations. J. Comb. Des. 13, 406–424 (2005)
4. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, p. 244. North Holland, New York (1976)
5. Cameron, P., Sheehan, J., Spiga, P.: Semiregular automorphisms of vertex-transitive cubic graphs. Eur. J. Comb. 27, 924–930 (2006)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献