Title: | Semiregular automorphisms in vertex-transitive graphs with a solvable group of automorphisms |
---|
Authors: | ID Marušič, Dragan (Author) |
Files: | RAZ_Marusic_Dragan_i2017.pdf (235,26 KB) MD5: 735FBD4E5D327BA888FB5876F88AC383
|
---|
Language: | English |
---|
Work type: | Unknown |
---|
Typology: | 1.01 - Original Scientific Article |
---|
Organization: | ZUP - University of Primorska Press
|
---|
Abstract: | It has been conjectured that automorphism groups of vertex-transitive (di)graphs, and more generally 2-closures of transitive permutation groups, must necessarily possess a fixed-point-free element of prime order, and thus a non-identity element with all orbits of the same length, in other words, a semiregular element. The known affirmative answers for graphs with primitive and quasiprimitive groups of automorphisms suggest that solvable groups need to be considered if one is to hope for a complete solution of this conjecture. It is the purpose of this paper to present an overview of known results and suggest possible further lines of research towards a complete solution of the problem. |
---|
Keywords: | solvable group, semiregular automorphism, fixed-point-free automorphism, polycirculant conjecture |
---|
Year of publishing: | 2017 |
---|
Number of pages: | str. 461-468 |
---|
Numbering: | Vol. 13, no. 2 |
---|
PID: | 20.500.12556/RUP-17629 |
---|
UDC: | 519.17:512.54 |
---|
ISSN on article: | 1855-3966 |
---|
COBISS.SI-ID: | 1539752900 |
---|
Publication date in RUP: | 02.01.2022 |
---|
Views: | 1145 |
---|
Downloads: | 18 |
---|
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. |