151. |
152. On two extensions of equimatchable graphsZakir Deniz, Tinaz Ekim, Tatiana Romina Hartinger, Martin Milanič, Mordechai Shalom, 2017, original scientific article Keywords: minimum maximal matching, equimatchable graph, edge dominating set, Gallai-Edmonds decomposition, parameterized complexity Published in RUP: 29.01.2018; Views: 2245; Downloads: 146 Link to full text |
153. |
154. |
155. |
156. 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: 2305; Downloads: 100 Full text (281,25 KB) |
157. |
158. |
159. |
160. |