| Title: | Edge-transitive core-free Nest graphs |
|---|
| Authors: | ID Kovács, István (Author) |
|---|
| Files: |  AMC_Kovacs_2025.pdf (466,20 KB)
MD5: 6A72188AFFB46DC5AF54400DDC866FC3
|
|---|
| Language: | English |
|---|
| Work type: | Unknown |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | ZUP - University of Primorska Press
|
|---|
| Abstract: | A finite simple graph Γ is called a Nest graph if it is regular of valency 6 and admits an automorphism ρ with two orbits of the same length such that at least one of the subgraphs induced by these orbits is a cycle. We say that Γ is core-free if no non-trivial subgroup of the group generated by ρ is normal in Aut(Γ). In this paper, we show that, if Γ is edge-transitive and core-free, then it is isomorphic to one of the following graphs: the complement of the Petersen graph, the Hamming graph H(2,4), the Shrikhande graph and a certain normal 2-cover of K_{3,3} by ℤ_2^4. |
|---|
| Keywords: | bicirculant, edge-transitive, primitive permutation group |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 11.03.2025 |
|---|
| Publisher: | Založba Univerze na Primorskem |
|---|
| Year of publishing: | 2025 |
|---|
| Number of pages: | 20 str. |
|---|
| Numbering: | Vol 25, no. 2, [article no.] P2.03 |
|---|
| PID: | 20.500.12556/RUP-21707  |
|---|
| UDC: | 51 |
|---|
| eISSN: | 1855-3974 |
|---|
| DOI: | 10.26493/1855-3974.2944.9cd |
|---|
| COBISS.SI-ID: | 173115139 |
|---|
| Publication date in RUP: | 10.09.2025 |
|---|
| Views: | 364 |
|---|
| Downloads: | 3 |
|---|
| 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. |
