1. Semiregular automorphisms in vertex-transitive graphs with a solvable group of automorphismsDragan Marušič, 2017, original scientific article Abstract: It has been conjectured that automorphism groups of vertex-transitive (di)graphs, and more generally 2-closures of transitive permutation groups, must necessarily possess a fixed-point-free element of prime order, and thus a non-identity element with all orbits of the same length, in other words, a semiregular element. The known affirmative answers for graphs with primitive and quasiprimitive groups of automorphisms suggest that solvable groups need to be considered if one is to hope for a complete solution of this conjecture. It is the purpose of this paper to present an overview of known results and suggest possible further lines of research towards a complete solution of the problem. Keywords: solvable group, semiregular automorphism, fixed-point-free automorphism, polycirculant conjecture Published in RUP: 03.01.2022; Views: 918; Downloads: 17 Full text (235,26 KB) |
2. |
3. |
4. |
5. |
6. |
7. A note on domination and independence-domination numbers of graphsMartin Milanič, 2013, published scientific conference contribution Abstract: Vizing's conjecture is true for graphs ▫$G$▫ satisfying ▫$\gamma^i(G) = \gamma(G)$▫, where ▫$\gamma(G)$▫ is the domination number of a graph ▫$G$▫ and ▫$\gamma^i(G)$▫ is the independence-domination number of ▫$G$▫, that is, the maximum, over all independent sets ▫$I$▫ in ▫$G$▫, of the minimum number of vertices needed to dominate ▫$I$▫. The equality ▫$\gamma^i(G) = \gamma(G)$▫ is known to hold for all chordal graphs and for chordless cycles of length ▫$0 \pmod{3}$▫. We prove some results related to graphs for which the above equality holds. More specifically, we show that the problems of determining whether ▫$\gamma^i(G) = \gamma(G) = 2$▫ and of verifying whether ▫$\gamma^i(G) \ge 2$▫ are NP-complete, even if ▫$G$▫ is weakly chordal. We also initiate the study of the equality ▫$\gamma^i = \gamma$▫ in the context of hereditary graph classes and exhibit two infinite families of graphs for which ▫$\gamma^i < \gamma$▫. Keywords: Vizing's conjecture, domination number, independence-domination number, weakly chordal graph, NP-completeness, hereditary graph class, IDD-perfect graph Published in RUP: 15.10.2013; Views: 3128; Downloads: 128 Full text (300,57 KB) |