1. |
2. |
3. |
4. |
5. |
6. The automorphism groups of non-edge transitive rose window graphsEdward Dobson, István Kovács, Štefko Miklavič, 2015, izvirni znanstveni članek Opis: 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. Ključne besede: rose window graphs, automorphism group, isomorphism problem, vertex-transitive graph Objavljeno v RUP: 31.12.2021; Ogledov: 567; Prenosov: 18
Polno besedilo (275,74 KB) |
7. |
8. |
9. |
10. On the balanced upper chromatic number of finite projective planesZoltán L. Blázsik, Aart Blokhuis, Štefko Miklavič, Zoltán Lóránt Nagy, Tamás Szőnyi, 2021, izvirni znanstveni članek Ključne besede: projective planes, balanced upper chromatic number, difference sets, planar functions, probabilistic method Objavljeno v RUP: 18.01.2021; Ogledov: 745; Prenosov: 34
Povezava na polno besedilo |