111. |
112. |
113. Linear separation of connected dominating sets in graphsNina Chiarelli, Martin Milanič, 2019, izvirni znanstveni članek Ključne besede: connected dominating set, connected domination, connected-domishold graph, forbidden induced subgraph characterization, split graph, chordal graph, minimal cutset, minimal separator, 1-Sperner hypergraph, threshold hypergraph, threshold Boolean function, polynomial-time algorithm Objavljeno v RUP: 04.04.2019; Ogledov: 2334; Prenosov: 158
Celotno besedilo (648,51 KB) |
114. |
115. Mamart, Siwaporn: A group commutator involving the last distance matrix and dual distance matrix of a Q-polynomial distance-regular graph: the Hamming graph case. - Graphs Combin. 34 (2018), no. 4, 803--817Safet Penjić, 2018, recenzija, prikaz knjige, kritika Ključne besede: distance-regular graph, Q-polynomial, distance matrix, dual distance matrix Objavljeno v RUP: 21.01.2019; Ogledov: 1631; Prenosov: 15
Povezava na celotno besedilo |
116. |
117. Quasi-semiregular automorphisms of cubic and tetravalent arc-transitive graphs : Group Action and Combinatorial Structures, Nankai University, Tianjin, China, 15. - 18. 6. 2018István Kovács, Yan-Quan Feng, Ademir Hujdurović, Klavdija Kutnar, Dragan Marušič, 2018, prispevek na konferenci brez natisa Ključne besede: quasi-semiregular automorphism, cubic graph, tetravalent graph, arc-transitive graph Objavljeno v RUP: 06.12.2018; Ogledov: 2126; Prenosov: 129
Povezava na celotno besedilo |
118. |
119. Odd extensions of transitive groups via symmetric graphs - The cubic caseKlavdija Kutnar, Dragan Marušič, 2018, izvirni znanstveni članek Opis: When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More precisely: when is it that the existence of automorphisms acting as even permutations on the vertex set of a graph, called even automorphisms, forces the existence of automorphisms that act as odd permutations, called odd automorphisms. As a first step towards resolving the above question, complete information on the existence of odd automorphisms in cubic symmetric graphs is given. Ključne besede: automorphism group, arc-transitive, even permutation, odd permutation, cubic symmetric graph Objavljeno v RUP: 19.11.2018; Ogledov: 2211; Prenosov: 198
Povezava na celotno besedilo |
120. |