| Title: | The automorphism groups of non-edge transitive rose window graphs |
|---|
| Authors: | ID Dobson, Edward (Author)
ID Kovács, István (Author)
ID Miklavič, Štefko (Author) |
|---|
| Files: |  RAZ_Dobson_Edward_i2015.pdf (275,74 KB)
MD5: FB4642FB8D45F337C1B2AB4B85451ACB
|
|---|
| Language: | English |
|---|
| Work type: | Unknown |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | ZUP - University of Primorska Press
|
|---|
| Abstract: | In this paper, we determine the full automorphism groups of rose window graphs that are not edge-transitive. As the full automorphism groups of edge-transitive rose window graphs have been determined, this complete the problem of calculating the full automorphism group of rose window graphs. As a corollary, we determine which rose window graphs are vertex-transitive. Finally, we determine the isomorphism classes of non-edge-transitive rose window graphs. |
|---|
| Keywords: | rose window graphs, automorphism group, isomorphism problem, vertex-transitive graph |
|---|
| Year of publishing: | 2015 |
|---|
| Number of pages: | str. 63-75 |
|---|
| Numbering: | Vol. 9, no. 1 |
|---|
| PID: | 20.500.12556/RUP-17614  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 1855-3966 |
|---|
| COBISS.SI-ID: | 1536920004 |
|---|
| Publication date in RUP: | 31.12.2021 |
|---|
| Views: | 975 |
|---|
| Downloads: | 19 |
|---|
| 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. |
