| Naslov: | Edge-transitive core-free Nest graphs |
|---|
| Avtorji: | ID Kovács, István (Avtor) |
|---|
| Datoteke: |  AMC_Kovacs_2025.pdf (466,20 KB)
MD5: 6A72188AFFB46DC5AF54400DDC866FC3
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Neznano |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: | ZUP - Založba Univerze na Primorskem
|
|---|
| Opis: | 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. |
|---|
| Ključne besede: | bicirculant, edge-transitive, primitive permutation group |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Datum objave: | 11.03.2025 |
|---|
| Založnik: | Založba Univerze na Primorskem |
|---|
| Leto izida: | 2025 |
|---|
| Št. strani: | 20 str. |
|---|
| Številčenje: | Vol 25, no. 2, [article no.] P2.03 |
|---|
| PID: | 20.500.12556/RUP-21707  |
|---|
| UDK: | 51 |
|---|
| eISSN: | 1855-3974 |
|---|
| DOI: | 10.26493/1855-3974.2944.9cd |
|---|
| COBISS.SI-ID: | 173115139 |
|---|
| Datum objave v RUP: | 10.09.2025 |
|---|
| Število ogledov: | 382 |
|---|
| Število prenosov: | 3 |
|---|
| Metapodatki: |    |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
