Title: | Odd automorphisms in vertex-transitive graphs |
---|
Authors: | ID Hujdurović, Ademir (Author) ID Kutnar, Klavdija (Author) ID Marušič, Dragan (Author) |
Files: | RAZ_Hujdurovic_Ademir_i2016.pdf (281,25 KB) MD5: 7500C82FD61C5212FB47F74B2F69415D
|
---|
Language: | English |
---|
Work type: | Unknown |
---|
Typology: | 1.01 - Original Scientific Article |
---|
Organization: | ZUP - University of Primorska Press
|
---|
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 |
---|
Year of publishing: | 2016 |
---|
Number of pages: | str. 427-437 |
---|
Numbering: | Vol. 10, no. 2 |
---|
PID: | 20.500.12556/RUP-8841 |
---|
UDC: | 519.17 |
---|
ISSN on article: | 1855-3966 |
---|
COBISS.SI-ID: | 1538542276 |
---|
Publication date in RUP: | 15.11.2017 |
---|
Views: | 2687 |
---|
Downloads: | 102 |
---|
Metadata: | |
---|
:
|
Copy citation |
---|
| | | Average score: | (0 votes) |
---|
Your score: | Voting is allowed only for logged in users. |
---|
Share: | |
---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |