Odd automorphisms in vertex-transitive graphs

DOI10.26493/1855-3974.1046.980zbMath1351.05106OpenAlexW2495654148WikidataQ129359032 ScholiaQ129359032MaRDI QIDQ2827794

Ademir Hujdurović, Dragan Marušič, Klavdija Kutnar

Publication date: 21 October 2016

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.1046.980

zbMATH Keywords

Cayley graphcirculantarc-transitivityeven permutationodd permutationdeleted lexicographic producteven closed graph

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (7)

On even-closed regular embeddings of graphs ⋮ Enumerating graphs via even/odd dichotomy ⋮ Odd extensions of transitive groups via symmetric graphs -- the cubic case ⋮ The automorphism group of the bipartite Kneser graph ⋮ Semiregular automorphisms in vertex-transitive graphs with a solvable group of automorphisms ⋮ Semiregular automorphisms in vertex-transitive graphs of order \(3p^2\) ⋮ Symmetric cubic graphs via rigid cells

This page was built for publication: Odd automorphisms in vertex-transitive graphs