151. |
152. On two extensions of equimatchable graphsZakir Deniz, Tinaz Ekim, Tatiana Romina Hartinger, Martin Milanič, Mordechai Shalom, 2017, izvirni znanstveni članek Ključne besede: minimum maximal matching, equimatchable graph, edge dominating set, Gallai-Edmonds decomposition, parameterized complexity
Objavljeno v RUP: 29.01.2018; Ogledov: 2245; Prenosov: 146
 Povezava na celotno besedilo |
153. |
154. |
155. |
156. Odd automorphisms in vertex-transitive graphsAdemir Hujdurović, Klavdija Kutnar, Dragan Marušič, 2016, izvirni znanstveni članek Opis: 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.
Ključne besede: graph, vertex-transitive, automorphism group, even permutation, odd permutation
Objavljeno v RUP: 15.11.2017; Ogledov: 2306; Prenosov: 100
 Celotno besedilo (281,25 KB) |
157. |
158. |
159. |
160. |
