31. |
32. Public employment services placement service's performance under scrutiny : Analysing placement service inherent causal assumptionsKlemen Širok, Katarina Košmrlj Muha, Suzana Sedmak, 2015, published scientific conference contribution abstract Keywords: zavod za zaposlovanje, trg dela, vrednotenje, placement, public employment service, program theory, evaluation
Published in RUP: 14.10.2015; Views: 2703; Downloads: 72
 Link to full text |
33. Myths of nationhood : Slovenians, Caranthania and the Venetic theoryVeronika Bajt, 2011, original scientific article Keywords: nationalism, national identity, national elites, national myths, ethnogenesis, Slovenia, Caranthania, Venetic theory
Published in RUP: 10.07.2015; Views: 3045; Downloads: 16
Link to full text |
34. Organization development and changeThomas G. Cummings, Christopher G. Worley, 2005, higher education textbook Keywords: organizacija, organizacijski razvoj, spremembe, teorija, kadri, tehnologija, proučevanje dela, uporaba človeških zmogljivosti, case study, zdravstveno varstvo, izobraževanje, javni sektor, organization, organizational development, changes, theory, personnel, technology, work study, human resource management, case study, health care, training, public sector
Published in RUP: 10.07.2015; Views: 4425; Downloads: 101
Link to full text |
35. Distance-regular Cayley graphs on dihedral groupsŠtefko Miklavič, Primož Potočnik, 2005, original scientific article Abstract: 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.
Keywords: mathematics, grah theory, distance-regular graph, distance-transitive graph, Cayley graph, dihedral group, dihedrant, difference set
Published in RUP: 10.07.2015; Views: 2548; Downloads: 90
Link to full text |
36. On overgroups of regular abelian p-groupsEdward Dobson, 2009, original scientific article Abstract: Let ▫$G$▫ be a transitive group of odd prime-power degree whose Sylow ▫$p$▫-subgroup ▫$P$▫ is abelian od rank ▫$t$▫. Weshow that if ▫$p > 2^{t-1}$▫, then ▫$G$▫ has a normal subgroup that is a direct product of ▫$t$▫ permutation groups of smaller degree that are either cyclic or doubly-transitive simple groups. As a consequence, we determine the full automorphism group of a Cayley diagraph of an abelian group with rank two such that the Sylow ▫$p$▫-subgroup of the full automorphism group is abelian.
Keywords: group theory, graph theory, Cayley graph, abelian group, regular group, p-group
Published in RUP: 15.10.2013; Views: 3212; Downloads: 157
Link to full text |
37. |
38. |
39. Arc-transitive cycle decompositions of tetravalent graphsŠtefko Miklavič, Primož Potočnik, Steve Wilson, 2008, original scientific article Abstract: A cycle decomposition of a graph ▫$\Gamma$▫ is a set ▫$\mathcal{C}$▫ of cycles of ▫$\Gamma$▫ such that every edge of ▫$\Gamma$▫ belongs to exactly one cycle in ▫$\mathcal{C}$▫. Such a decomposition is called arc-transitive if the group of automorphisms of ▫$\Gamma$▫ that preserve setwise acts transitively on the arcs of ▫$\Gamma$▫. In this paper, we study arc-transitive cycle decompositions of tetravalent graphs. In particular, we are interested in determining and enumerating arc-transitive cycle decompositions admitted by a given arc-transitive tetravalent graph. Among other results we show that a connected tetravalent arc-transitive graph is either 2-arc-transitive, or is isomorphic to the medial graph of a reflexible map, or admits exactly one cycle structure.
Keywords: mathematics, graph theory, cycle decomposition, automorphism group, consistent cycle, medial maps
Published in RUP: 15.10.2013; Views: 3652; Downloads: 85
Link to full text |
40. Hamiltonian cycles in Cayley graphs whose order has few prime factorsKlavdija 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: 3514; Downloads: 120
 Full text (545,91 KB) |
