Lupa

Search the repository Help

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

Options:
  Reset


51 - 60 / 92
First pagePrevious page12345678910Next pageLast page
51.
Editorial
Klavdija Kutnar, Štefko Miklavič, Tomaž Pisanski, Primož Šparl, 2015, preface, editorial, afterword

Published in RUP: 15.10.2015; Views: 2074; Downloads: 24
URL Link to full text

52.
53.
54.
A note on a geometric construction of large Cayley graps of given degree and diameter
György Kiss, István Kovács, Klavdija Kutnar, János Ruff, Primož Šparl, 2009, original scientific article

Abstract: An infinite series and some sporadic examples of large Cayley graphs with given degree and diameter are constructed. The graphs arise from arcs, caps and other objects of finite projective spaces.
Keywords: degree, diameter problem, Moore bound, finite projective spaces
Published in RUP: 15.10.2013; Views: 3348; Downloads: 69
URL Link to full text

55.
56.
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: 3379; Downloads: 98
URL Link to full text

57.
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: 3523; Downloads: 120
.pdf Full text (545,91 KB)

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

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

59.
60.
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: 3004; Downloads: 82
URL Link to full text

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