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


1 - 3 / 3
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
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: ključnih besedah
Povzetek najdenega: ...Cayley graph, Hamilton cycle, arc-transitive graph, 1-regular action, automorphism group...
Ključne besede: Cayley graph, Hamilton cycle, arc-transitive graph, 1-regular action, automorphism group
Objavljeno: 15.10.2013; Ogledov: 1254; Prenosov: 61
URL Polno besedilo (0,00 KB)

2.
Algebraični aspekti teorije grafov
Ademir Hujdurović, 2013, doktorska disertacija

Najdeno v: ključnih besedah
Povzetek najdenega: ...quasi m-Cayley graph, generalized Cayley graph, I-regular action, regular cover of a graph, automorphism group,... ...circulant, bicirculant, semiregular automorphism, vertex-transitive graph, half-arc-transitive graph, snark, Cayley graph,...
Ključne besede: circulant, bicirculant, semiregular automorphism, vertex-transitive graph, half-arc-transitive graph, snark, Cayley graph, quasi m-Cayley graph, generalized Cayley graph, I-regular action, regular cover of a graph, automorphism group
Objavljeno: 10.07.2015; Ogledov: 1569; Prenosov: 4
URL Polno besedilo (0,00 KB)

3.
On even-closed regular embeddings of graphs
István Kovács, Klavdija Kutnar, Dragan Marušič, Daniel Pellicer, 2018, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...odd action automorphism, even action automorphism, automorphism group, vertex-transitive...
Ključne besede: odd action automorphism, even action automorphism, automorphism group, vertex-transitive graph, orientable-regular map
Objavljeno: 18.07.2018; Ogledov: 937; Prenosov: 84
URL Polno besedilo (0,00 KB)

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