31. Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theoremAdemir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2018, izvirni znanstveni članek Ključne besede: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness Objavljeno v RUP: 08.05.2018; Ogledov: 4627; Prenosov: 163
Povezava na celotno besedilo |
32. |
33. |
34. |
35. |
36. |
37. |
38. |
39. 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: 4238; Prenosov: 105
Celotno besedilo (281,25 KB) |
40. |