1. |
2. |
3. |
4. |
5. On colour-preserving automorphisms of Cayley graphsAdemir Hujdurović, Klavdija Kutnar, Dave Witte Morris, Joy Morris, 2016, original scientific article Abstract: We study the automorphisms of a Cayley graph that preserve its natural edge-colouring. More precisely, we are interested in groups ▫$G$▫, such that every such automorphism of every connected Cayley graph on ▫$G$▫ has a very simple form: the composition of a left-translation and a group automorphism. We find classes of groups that have the property, and we determine the orders of all groups that do not have the property. We also have analogous results for automorphisms that permute the colours, rather than preserving them. Keywords: Cayley graph, automorphism, colour-preserving, colour-permuting Published in RUP: 03.01.2022; Views: 652; Downloads: 16 Full text (412,93 KB) |
6. |
7. |
8. |
9. |
10. Mind the independence gapTinaz Ekim, Didem Gozüpek, Ademir Hujdurović, Martin Milanič, 2020, original scientific article Keywords: maximal independent set, independent dominating set, well-covered graph, hereditary independence gap, polynomial-time algorithm, NP-hard problem Published in RUP: 19.05.2020; Views: 1503; Downloads: 57 Link to full text |