# Search the repository

 Query: search in TitleAuthorAbstractKeywordsFull textYear of publishing ANDORAND NOT search in TitleAuthorAbstractKeywordsFull textYear of publishing ANDORAND NOT search in TitleAuthorAbstractKeywordsFull textYear of publishing ANDORAND NOT search in TitleAuthorAbstractKeywordsFull textYear of publishing Work type: All work types Habilitation (m4) Specialist thesis (m3) High school thesis (m6) Bachelor work * (dip) Master disertations * (mag) Doctorate disertations * (dok) Research Data or Corpuses (data) * old and bolonia study programme Language: All languagesSlovenianEnglishGermanCroatianSerbianBosnianBulgarianCzechFinnishFrenchGerman (Austria)HungarianItalianJapaneseLithuanianNorwegianPolishRussianSerbian (cyrillic)SlovakSpanishSwedishTurkishUnknown Search in: RUP    FAMNIT - Faculty of Mathematics, Science and Information Technologies    FHŠ - Faculty of Humanities    FM - Faculty of Management    FTŠ Turistica - Turistica – College of Tourism Portorož    FVZ - Faculty of Health Sciences    IAM - Andrej Marušič Institute    PEF - Faculty of Education    UPR - University of PrimorskaCOBISS    Fakulteta za humanistične študije, Koper    Fakulteta za management Koper in Pedagoška fakulteta Koper    Fakulteta za vede o zdravju, Izola    Knjižnica za tehniko, medicino in naravoslovje, Koper    Turistica, Portorož    Znanstveno-raziskovalno središče Koper Options: Show only hits with full text Reset

 11 - 20 / 611234567 11.Asymptotic automorphism groups of Cayley digraphs and graphs of abelian groups of prime-power orderEdward Dobson, 2010, original scientific articleAbstract: We show that almost every Cayley graph ▫$\Gamma$▫ of an abelian group ▫$G$▫ of odd prime-power order has automorphism group as small as possible. Additionally, we show that almost every Cayley (di)graph ▫$\Gamma$▫ of an abelian group ▫$G$▫ of odd prime-power order that does not have automorphism group as small as possible is a normal Cayley (di)graph of ▫$G$▫ (that is, ▫$G_L \triangleleft {\rm Aut}(\Gamma))$▫.Found in: ključnih besedahKeywords: mathematics, graph theory, Cayley graph, abelian group, automorphism group, asymptotic, ▫$p$▫-groupPublished: 15.10.2013; Views: 2521; Downloads: 58 Full text (0,00 KB) 12.Hamilton paths and cycles in vertex-transitive graphs of order 6pKlavdija Kutnar, Primož Šparl, 2009, original scientific articleAbstract: It is shown that every connected vertex-transitive graph of order ▫$6p$▫, where ▫$p$▫ is a prime, contains a Hamilton path. Moreover, it is shown that, except for the truncation of the Petersen graph, every connected vertex-transitive graph of order ▫$6p$▫ which is not genuinely imprimitive contains a Hamilton cycle.Found in: ključnih besedahSummary of found: ...graph theory, vertex-transitive, Hamilton cycle, Hamilton path, automorphism group...Keywords: graph theory, vertex-transitive, Hamilton cycle, Hamilton path, automorphism groupPublished: 15.10.2013; Views: 1676; Downloads: 14 Full text (0,00 KB) 13.On cubic non-Cayley vertex-transitive graphsKlavdija Kutnar, Dragan Marušič, Cui Zhang, 2012, original scientific articleFound in: ključnih besedahSummary of found: ...vertex-transitive graph, non-Cayley graph, automorphism group, ...Keywords: vertex-transitive graph, non-Cayley graph, automorphism groupPublished: 15.10.2013; Views: 1270; Downloads: 63 Full text (0,00 KB) 14.Hamilton cycles in (2, odd, 3)-Cayley graphsHenry Glover, Klavdija Kutnar, Aleksander Malnič, Dragan Marušič, 2012, original scientific articleAbstract: 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.Found in: ključnih besedahSummary of found: ...graph, Hamilton cycle, arc-transitive graph, 1-regular action, automorphism group...Keywords: Cayley graph, Hamilton cycle, arc-transitive graph, 1-regular action, automorphism groupPublished: 15.10.2013; Views: 1249; Downloads: 60 Full text (0,00 KB) 15.On cubic non-Cayley vertex-transitive graphsKlavdija Kutnar, 2010, invited lecture at foreign universityFound in: ključnih besedahSummary of found: ...non-Cayley, vertex-transitive, automorphism grup, ...Keywords: non-Cayley, vertex-transitive, automorphism grupPublished: 15.10.2013; Views: 1539; Downloads: 45 Full text (0,00 KB) 16.Semiregular automorphisms of arc-transitive graphsGabriel Verret, 2013, published scientific conference contribution abstractFound in: ključnih besedahSummary of found: ... automorphism group, arc-transitive graph, semiregular automorphism, ...Keywords: automorphism group, arc-transitive graph, semiregular automorphismPublished: 15.10.2013; Views: 1729; Downloads: 21 Full text (0,00 KB)This document has more files! More... 17.On vertex-stabilizers of bipartite dual polar graphsŠtefko Miklavič, 2010, original scientific articleAbstract: Let ▫$X,Y$▫ denote vertices of a bipartite dual polar graph, and let ▫$G_X$▫ and ▫$G_Y$▫ denote the stabilizers of ▫$X$▫ and ▫$Y$▫ in the full automorphism group of this graph. In this paper, a description of the orbits of ▫$G_X \cap G_Y$▫ in the cases when the distance between ▫$X$▫ and ▫$Y$▫ is 1 or 2, is given.Found in: ključnih besedahSummary of found: ...of ▫$X$▫ and ▫$Y$▫ in the full automorphism group of this graph. In this paper,...Keywords: dual polar graphs, automorphism group, quadratic form, isotropic subspacePublished: 15.10.2013; Views: 1375; Downloads: 57 Full text (0,00 KB) 18.On the order of arc-stabilizers in arc-transitive graphsGabriel Verret, 2009, published scientific conference contribution abstractFound in: ključnih besedahSummary of found: ...arc-transitivie graph, arc-stabilizer, automorphism group, ...Keywords: arc-transitivie graph, arc-stabilizer, automorphism groupPublished: 15.10.2013; Views: 1541; Downloads: 30 Full text (0,00 KB) 19.Classification of cubic symmetric tetracirculants and pentacirculantsBoštjan Frelih, Klavdija Kutnar, 2013, original scientific articleFound in: ključnih besedahSummary of found: ...cubic graph, symmetric, semiregular automorphism, tetracirculant, pentacirculant, ...Keywords: cubic graph, symmetric, semiregular automorphism, tetracirculant, pentacirculantPublished: 15.10.2013; Views: 1394; Downloads: 50 Full text (0,00 KB) 20.Distance-transitive graphs admit semiregular automorphismsKlavdija Kutnar, Primož Šparl, 2010, original scientific articleAbstract: 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.Found in: ključnih besedahSummary of found: ...between ▫$u'$▫ and ▫$v'$▫ there exists an automorphism of the graph mapping ▫$u$▫ to ▫$u'$▫...Keywords: distance-transitive graph, vertex-transitive graph, semiregular automorphism, permutation groupPublished: 15.10.2013; Views: 1696; Downloads: 57 Full text (0,00 KB)
Search done in 0 sec.