31. |
32. |
33. |
34. Odd automorphisms in vertex-transitive graphsAdemir Hujdurović, Klavdija Kutnar, Dragan Marušič, 2016, original scientific article Abstract: An automorphism of a graph is said to be even/odd if it acts on the set of vertices as an even/odd permutation. In this article we pose the problem of determining which vertex-transitive graphs admit odd automorphisms. Partial results for certain classes of vertex-transitive graphs, in particular for Cayley graphs, are given. As a consequence, a characterization of arc-transitive circulants without odd automorphisms is obtained. Keywords: graph, vertex-transitive, automorphism group, even permutation, odd permutation Published in RUP: 15.11.2017; Views: 2293; Downloads: 100 Full text (281,25 KB) |
35. |
36. |
37. Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphsDidem Gozüpek, Ademir Hujdurović, Martin Milanič, 2017, original scientific article Keywords: lekisikografski product grafov, minimalna dominantna množica, dobro dominiran graf, nesvodljiva dominantna množica, lexicographic product of graphs, minimal dominating set, well-dominated graph, irreducible dominating set Published in RUP: 14.11.2017; Views: 2129; Downloads: 65 Link to full text |
38. The minimum conflict-free row split problem revisitedAdemir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2016, published scientific conference contribution Keywords: #the #minimum conflict-free row split problem, branching, Dilworth's theorem, min-max theorem, approximation algorithm, APX-hardness Published in RUP: 14.11.2017; Views: 2647; Downloads: 275 Link to full text This document has more files! More... |
39. |
40. |