Odd automorphisms in vertex-transitive graphs

Authors

  • Ademir Hujdurović University of Primorska
  • Klavdija Kutnar University of Primorska
  • Dragan Marušič University of Primorska

DOI:

https://doi.org/10.26493/1855-3974.1046.980

Keywords:

Graph, vertex-transitive, automorphism group, even permutation, odd permutation

Abstract

An automorphism of a graph is said to be even/odd if it acts on the set of vertices as an even/odd permutation. In this article we pose the problem of determining which vertex-transitive graphs admit odd automorphisms. Partial results for certain classes of vertex-transitive graphs, in particular for Cayley graphs, are given. As a consequence, a characterization of arc-transitive circulants without odd automorphisms is obtained.

Downloads

Additional Files

Published

2016-07-25

Issue

Vol. 10 No. 2 (2016)

Section

Articles

License

Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/