Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


31 - 40 / 104
Na začetekNa prejšnjo stran12345678910Na naslednjo stranNa konec
31.
Hamilton cycles in (2, odd, 3)-Cayley graphs
Henry Glover, Klavdija Kutnar, Aleksander Malnič, Dragan Marušič, 2012, izvirni znanstveni članek

Opis: 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.
Najdeno v: osebi
Ključne besede: Cayley graph, Hamilton cycle, arc-transitive graph, 1-regular action, automorphism group
Objavljeno: 15.10.2013; Ogledov: 1195; Prenosov: 53
URL Polno besedilo (0,00 KB)

32.
On cubic non-Cayley vertex-transitive graphs
Klavdija Kutnar, 2010, predavanje na tuji univerzi

Najdeno v: osebi
Ključne besede: non-Cayley, vertex-transitive, automorphism grup
Objavljeno: 15.10.2013; Ogledov: 1475; Prenosov: 40
URL Polno besedilo (0,00 KB)

33.
Cubic Cayley graphs and snarks
Klavdija Kutnar, Ademir Hujdurović, Dragan Marušič, 2012, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Najdeno v: osebi
Ključne besede: Cayley graph, snark, arc-transitive graph, Cayley map
Objavljeno: 15.10.2013; Ogledov: 1182; Prenosov: 41
URL Polno besedilo (0,00 KB)

34.
Classification of cubic symmetric tetracirculants and pentacirculants
Boštjan Frelih, Klavdija Kutnar, 2013, izvirni znanstveni članek

Najdeno v: osebi
Ključne besede: cubic graph, symmetric, semiregular automorphism, tetracirculant, pentacirculant
Objavljeno: 15.10.2013; Ogledov: 1303; Prenosov: 44
URL Polno besedilo (0,00 KB)

35.
Bled'11
Klavdija Kutnar, Primož Šparl, 2013, predgovor, spremna beseda

Najdeno v: osebi
Objavljeno: 15.10.2013; Ogledov: 1004; Prenosov: 21
URL Polno besedilo (0,00 KB)

36.
Hamiltonian cycles in Cayley graphs whose order has few prime factors
Klavdija Kutnar, Dragan Marušič, D. W. Morris, Joy Morris, Primož Šparl, 2012, izvirni znanstveni članek

Opis: 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$▫.
Najdeno v: osebi
Ključne besede: graph theory, Cayley graphs, hamiltonian cycles
Objavljeno: 15.10.2013; Ogledov: 1535; Prenosov: 57
URL Polno besedilo (0,00 KB)

37.
Distance-transitive graphs admit semiregular automorphisms
Klavdija Kutnar, Primož Šparl, 2010, izvirni znanstveni članek

Opis: 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.
Najdeno v: osebi
Ključne besede: distance-transitive graph, vertex-transitive graph, semiregular automorphism, permutation group
Objavljeno: 15.10.2013; Ogledov: 1616; Prenosov: 50
URL Polno besedilo (0,00 KB)

38.
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, 2008, objavljeni povzetek znanstvenega prispevka na konferenci

Najdeno v: osebi
Ključne besede: diameter-degree problem, Cayley graph, projective space
Objavljeno: 15.10.2013; Ogledov: 1685; Prenosov: 11
URL Polno besedilo (0,00 KB)

39.
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, izvirni znanstveni članek

Opis: 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.
Najdeno v: osebi
Ključne besede: degree, diameter problem, Moore bound, finite projective spaces
Objavljeno: 15.10.2013; Ogledov: 1588; Prenosov: 22
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

40.
Fibonaccijeva števila in zlati rez v umetnosti
Katarina Biščak, 2013, magistrsko delo

Najdeno v: osebi
Ključne besede: Fibonaccijeva števila, Fibonaccijevo zaporedje, posplošeno Fibonaccijevo zaporedje, zlati rez, geometrija, likovna umetnost, kiparstvo, arhitektura, glasba
Objavljeno: 10.07.2015; Ogledov: 1393; Prenosov: 28
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici