Print
Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


101 - 110 / 144
First pagePrevious page6789101112131415Next pageLast page
101.
102.
Sistem vodenja kakovosti
Klavdija Tomc, 2013, undergraduate thesis

Keywords: kakovost, management, standardi ISO, kupci, zadovoljstvo
Published in RUP: 15.10.2013; Views: 3276; Downloads: 159
URL Link to full text
This document has more files! More...

103.
Distance-transitive graphs admit semiregular automorphisms
Klavdija Kutnar, Primož Šparl, 2010, original scientific article

Abstract: A distance-transitive graph is a graph in which for every two ordered pairs ofvertices ▫$(u,v)$▫ and ▫$(u',v')$▫ such that the distance between ▫$u$▫ and ▫$v$▫ is equal to the distance between ▫$u'$▫ and ▫$v'$▫ there exists an automorphism of the graph mapping ▫$u$▫ to ▫$u'$▫ and ▫$v$▫ to ▫$v'$▫. A semiregular element of a permutation group is anon-identity element having all cycles of equal length in its cycle decomposition. It is shown that every distance-transitive graph admits a semiregular automorphism.
Keywords: distance-transitive graph, vertex-transitive graph, semiregular automorphism, permutation group
Published in RUP: 15.10.2013; Views: 3282; Downloads: 98
URL Link to full text

104.
Hamiltonian cycles in Cayley graphs whose order has few prime factors
Klavdija Kutnar, Dragan Marušič, D. W. Morris, Joy Morris, Primož Šparl, 2012, original scientific article

Abstract: We prove that if Cay▫$(G; S)$▫ is a connected Cayley graph with ▫$n$▫ vertices, and the prime factorization of ▫$n$▫ is very small, then Cay▫$(G; S)$▫ has a hamiltonian cycle. More precisely, if ▫$p$▫, ▫$q$▫, and ▫$r$▫ are distinct primes, then ▫$n$▫ can be of the form kp with ▫$24 \ne k < 32$▫, or of the form ▫$kpq$▫ with ▫$k \le 5$▫, or of the form ▫$pqr$▫, or of the form ▫$kp^2$▫ with ▫$k \le 4$▫, or of the form ▫$kp^3$▫ with ▫$k \le 2$▫.
Keywords: graph theory, Cayley graphs, hamiltonian cycles
Published in RUP: 15.10.2013; Views: 3389; Downloads: 120
.pdf Full text (545,91 KB)

105.
Bled'11
Klavdija Kutnar, Primož Šparl, 2013, preface, editorial, afterword

Published in RUP: 15.10.2013; Views: 2333; Downloads: 65
URL Link to full text

106.
107.
Cubic Cayley graphs and snarks
Klavdija Kutnar, Ademir Hujdurović, Dragan Marušič, 2012, published scientific conference contribution abstract (invited lecture)

Keywords: Cayley graph, snark, arc-transitive graph, Cayley map
Published in RUP: 15.10.2013; Views: 2897; Downloads: 81
URL Link to full text

108.
On cubic non-Cayley vertex-transitive graphs
Klavdija Kutnar, 2010, invited lecture at foreign university

Keywords: non-Cayley, vertex-transitive, automorphism grup
Published in RUP: 15.10.2013; Views: 2867; Downloads: 81
URL Link to full text

109.
Hamilton cycles in (2, odd, 3)-Cayley graphs
Henry Glover, Klavdija Kutnar, Aleksander Malnič, Dragan Marušič, 2012, original scientific article

Abstract: In 1969, Lovász asked if every finite, connected vertex-transitive graph has a Hamilton path. In spite of its easy formulation, no major breakthrough has been achieved thus far, and the problem is now commonly accepted to be very hard. The same holds for the special subclass of Cayley graphs where the existence of Hamilton cycles has been conjectured. In 2007, Glover and Marušič proved that a cubic Cayley graph on a finite ▫$(2, s, 3)$▫-generated group ▫$G = \langle a, x| a^2 = x^s = (ax)^3 = 1, \dots \rangle$▫ has a Hamilton path when ▫$|G|$▫ is congruent to 0 modulo 4, and has a Hamilton cycle when ▫$|G|$▫ is congruent to 2 modulo 4. The Hamilton cycle was constructed, combining the theory of Cayley maps with classical results on cyclic stability in cubic graphs, as the contractible boundary of a tree of faces in the corresponding Cayley map. With a generalization of these methods, Glover, Kutnar and Marušič in 2009 resolved the case when, apart from ▫$|G|$▫, also ▫$s$▫ is congruent to 0 modulo 4. In this article, with a further extension of the above "tree of faces" approach, a Hamilton cycle is shown to exist whenever ▫$|G|$▫ is congruent to 0 modulo 4 and s is odd. This leaves ▫$|G|$▫ congruent to 0 modulo 4 with s congruent to 2 modulo 4 as the only remaining open case. In this last case, however, the "tree of faces" approach cannot be applied, and so entirely different techniques will have to be introduced if one is to complete the proof of the existence of Hamilton cycles in cubic Cayley graphs arising from finite ▫$(2, s, 3)$▫-generated groups.
Keywords: Cayley graph, Hamilton cycle, arc-transitive graph, 1-regular action, automorphism group
Published in RUP: 15.10.2013; Views: 2918; Downloads: 133
URL Link to full text

110.
Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica