# 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

 1 - 10 / 57123456 1.Hamilton paths in vertex-transitive graphs of order 10pKlavdija Kutnar, Dragan Marušič, Cui Zhang, 2012, original scientific articleAbstract: It is shown that every connected vertex-transitive graph of order ▫$10p$▫, ▫$p \ne 7$▫ a prime, which is not isomorphic to a quasiprimitive graph arising from the action of PSL▫$(2,k)$▫ on cosets of ▫$\mathbb{Z}_k \times \mathbb{Z}_{(k-1)/10}$▫, contains a Hamilton path.Found in: ključnih besedahKeywords: graph, vertex-transitive, Hamilton cycle, Hamilton path, automorphism groupPublished: 15.10.2013; Views: 1695; Downloads: 11 Full text (0,00 KB) 2.On the order of arc-stabilisers in arc-transitive graphs, IIGabriel Verret, 2013, original scientific articleFound in: ključnih besedahSummary of found: ...arc-transitive graphs, graph-restrictive group, local action, ...Keywords: arc-transitive graphs, graph-restrictive group, local actionPublished: 15.10.2013; Views: 1964; Downloads: 42 Full text (0,00 KB) 3.Hamiltonicity of vertex-transitive graphs of order 4pKlavdija Kutnar, Dragan Marušič, 2008, original scientific articleAbstract: It is shown that every connected vertex-transitive graph of order ▫$4p$▫, where ▫$p$▫ is a prime, is hamiltonian with the exception of the Coxeter graph which is known to possess a Hamilton path.Found in: ključnih besedahKeywords: graph theory, vertex-transitive graphs, Hamilton cycle, automorphism groupPublished: 15.10.2013; Views: 1580; Downloads: 17 Full text (0,00 KB) 4.The full automorphism group of Cayley graphs of ${mathbb Z}_ptimes{mathbbZ}_{p^2}$Edward Dobson, 2012, original scientific articleFound in: ključnih besedahKeywords: Cayley graph, abelian group, automorphism groupPublished: 15.10.2013; Views: 1740; Downloads: 31 Full text (0,00 KB) 5.On non-normal arc-transitive 4-valent dihedrantsIstván Kovács, Boštjan Kuzman, Aleksander Malnič, 2010, original scientific articleAbstract: Let ▫$X$▫ be a connected non-normal 4-valent arc-transitive Cayley graph on a dihedral group ▫$D_n$▫ such that ▫$X$▫ is bipartite, with the two bipartition sets being the two orbits of the cyclic subgroup within ▫$D_n$▫. It is shown that ▫$X$▫ is isomorphic either to the lexicographic product ▫$C_n[2K_1]$▫ with ▫$n \geq 4$▫ even, or to one of the five sporadic graphs on 10, 14, 26, 28 and 30 vertices, respectively.Found in: ključnih besedahSummary of found: ...4-valent arc-transitive Cayley graph on a dihedral group ▫$D_n$▫ such that ▫$X$▫ is bipartite, with...Keywords: Cayley graph, arc transitivity, dihedral groupPublished: 15.10.2013; Views: 1748; Downloads: 38 Full text (0,00 KB) 6.Classification of 2-arc-transitive dihedrantsShao Fei Du, Aleksander Malnič, Dragan Marušič, 2008, original scientific articleAbstract: A complete classification of 2-arc-transitive dihedrants, that is, Cayley graphs of dihedral groups is given, thus completing the study of these graphs initiated by the third author in [D. Marušič, On 2-arc-transitivity of Cayley graphs, J. Combin. Theory Ser. B 87 (2003) 162-196]. The list consists of the following graphs: (i) cycles ▫$C_{2n},\; n \ge 3$▫; (ii) complete graphs ▫$K_{2n}, \; n \ge 3$▫; (iii) complete bipartite graphs ▫$K_{n,n}, \; n \ge 3$▫; (iv) complete bipartite graphs minus a matching ▫$K_{n,n} - nK_2, \; n \ge 3$▫; (v) incidence and nonincidence graphs ▫$B(H_{11})$▫ and ▫$B'(H_{11})$▫ of the Hadamard design on 11 points; (vi) incidence and nonincidence graphs ▫$B(PG(d,q))$▫ and ▫$B'(PG(d,q))$▫, with ▫$d \ge 2$▫ and ▫$q$▫ a prime power, of projective spaces; (vii) and an infinite family of regular ▫${\mathbb{Z}}_d$▫-covers ▫$K_{q+1}^{2d}$▫ of ▫$K_{q+1, q+1} - (q+1)K_2$▫, where ▫$q \ge 3$▫ is an odd prime power and ▫$d$▫ is a divisor of ▫$\frac{q-1}{2}$▫ and ▫$q-1$▫, respectively, depending on whether ▫$q \equiv 1 \pmod{4}$▫ or ▫$q \equiv 3 \pmod{4}$▫ obtained by identifying the vertex set of the base graph with two copies of the projective line ▫$PG(1,q)$▫, where the missing matching consists of all pairs of the form ▫$[i,i']$▫, ▫$i \in PG(1,q)$▫, and the edge ▫$[i,j']$▫ carries trivial voltage if ▫$i=\infty$▫ or ▫$j=\infty$▫, and carries voltage ▫$\bar{h} \in {\mathbb{Z}}_d$▫, the residue class of ▫$h \in {\mathbb{Z}}_d$▫, if and only if ▫$i-j = \theta^h$▫, where ▫$\theta$▫ generates the multiplicative group ▫${\mathbb{F}}_q^\ast$▫ of the Galois field ▫${\mathbb{F}}_q$▫.Found in: ključnih besedahSummary of found: ...dihedrants, that is, Cayley graphs of dihedral groups is given, thus completing the study of...Keywords: permutation group, imprimitive group, dihedral group, Cayley graph, dihedrant, 2-Arc-transitive graphPublished: 15.10.2013; Views: 1555; Downloads: 46 Full text (0,00 KB) 7.Primitive groups of degree twice a prime numberDragan Marušič, 2012, unpublished invited conference lectureFound in: ključnih besedahSummary of found: ...primitive group, strongly regular graph, primitive action, ...Keywords: primitive group, strongly regular graph, primitive actionPublished: 15.10.2013; Views: 1581; Downloads: 23 Full text (0,00 KB) 8.On quartic half-arc-transitive metacirculantsDragan Marušič, Primož Šparl, 2008, original scientific articleAbstract: Following Alspach and Parsons, a metacirculant graph is a graph admitting a transitive group generated by two automorphisms ▫$\rho$▫ and ▫$\sigma$▫, where ▫$\rho$▫ is ▫$(m,n)$▫-semiregular for some integers ▫$m \ge 1$▫, ▫$n \ge 2▫$, and where ▫$\sigma$▫ normalizes ▫$\rho$▫, cyclically permuting the orbits of ▫$\rho$▫ in such a way that ▫$\sigma^m$▫ has at least one fixed vertex. A half-arc-transitive graph is a vertex- and edge- but not arc-transitive graph. In this article quartic half-arc-transitive metacirculants are explored and their connection to the so called tightly attached quartic half-arc-transitive graphs is explored. It is shown that there are three essentially different possibilities for a quartic half-arc-transitive metacirculant which is not tightly attached to exist. These graphs are extensively studied and some infinite families of such graphs are constructed.Found in: ključnih besedahSummary of found: ...graph is a graph admitting a transitive group generated by two automorphisms ▫$\rho$▫ and ▫$\sigma$▫,...Keywords: mathematics, graph theory, metacirculant graph, half-arc-transitive graph, tightly attached, automorphism groupPublished: 15.10.2013; Views: 1636; Downloads: 57 Full text (0,00 KB) 9.The full automorphism group of a Cayley graphGabriel Verret, 2013, published scientific conference contribution abstract (invited lecture)Found in: ključnih besedahKeywords: automorphism group, Cayley graphPublished: 15.10.2013; Views: 2243; Downloads: 19 Full text (0,00 KB)This document has more files! More... 10.Distance-regular Cayley graphs on dihedral groupsŠtefko Miklavič, Primož Potočnik, 2007, original scientific articleAbstract: The main result of this article is a classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious families of such graphs, which are called trivial. These are: complete graphs, complete bipartite graphs, complete bipartite graphs with the edges of a 1-factor removed, and cycles. It is proved that every non-trivial distance-regular Cayley graph on a dihedral group is bipartite, non-antipodal, has diameter 3 and arises either from a cyclic di#erence set, or possibly (if any such exists) from a dihedral difference set satisfying some additional conditions. Finally, all distance-transitive Cayley graphs on dihedral groups are determined. It transpires that a Cayley graph on a dihedral group is distance-transitive if and only if it is trivial, or isomorphic to the incidence or to the non-incidence graph of a projective space ▫$\mathrm{PG}_{d-1} (d,q)$▫, ▫$d \ge 2$▫, or the unique pair of complementary symmetric designs on 11 vertices.Found in: ključnih besedahSummary of found: ...classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious families of such...Keywords: mathematics, grah theory, distance-regular graph, distance-transitive graph, Cayley graph, dihedral group, dihedrant, difference setPublished: 15.10.2013; Views: 1235; Downloads: 54 Full text (0,00 KB)
Search done in 0 sec.