31. |
32. |
33. |
34. |
35. |
36. |
37. |
38. |
39. |
40. Odd automorphisms in vertex-transitive graphsAdemir Hujdurović, Klavdija Kutnar, Dragan Marušič, 2016, original scientific article 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. Keywords: graph, vertex-transitive, automorphism group, even permutation, odd permutation Published in RUP: 15.11.2017; Views: 2393; Downloads: 100 Full text (281,25 KB) |