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 / 69
Na začetekNa prejšnjo stran1234567Na naslednjo stranNa konec
31.
Graph classes : from practice to theory
Martin Milanič, 2015, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Ključne besede: uporaba teorije grafov, razred grafov, pragoven graf, problem nahrbtnika, application of graph theory, graph class, threshold graph, knapsack problem
Objavljeno v RUP: 08.08.2016; Ogledov: 2466; Prenosov: 18
URL Povezava na celotno besedilo

32.
33.
34.
35.
Distance-regular Cayley graphs on dihedral groups
Štefko Miklavič, Primož Potočnik, 2005, izvirni znanstveni članek

Opis: 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.
Ključne besede: mathematics, grah theory, distance-regular graph, distance-transitive graph, Cayley graph, dihedral group, dihedrant, difference set
Objavljeno v RUP: 10.07.2015; Ogledov: 2582; Prenosov: 90
URL Povezava na celotno besedilo

36.
On overgroups of regular abelian p-groups
Edward Dobson, 2009, izvirni znanstveni članek

Opis: 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.
Ključne besede: group theory, graph theory, Cayley graph, abelian group, regular group, p-group
Objavljeno v RUP: 15.10.2013; Ogledov: 3236; Prenosov: 157
URL Povezava na celotno besedilo

37.
Knowledge resources and competive advantage
Doris Gomezelj Omerzel, Rune Ellemose Gulev, 2011, izvirni znanstveni članek

Ključne besede: knowledge, competitiveness, firm performance, knowledge-based theory
Objavljeno v RUP: 15.10.2013; Ogledov: 2475; Prenosov: 71
.pdf Celotno besedilo (151,53 KB)

38.
Non-financial performance ratios as a management tool
Franko Milost, 2004, objavljeni znanstveni prispevek na konferenci

Ključne besede: accounting, accounting theory, performance ratios, management
Objavljeno v RUP: 15.10.2013; Ogledov: 3309; Prenosov: 73
URL Povezava na celotno besedilo

39.
Arc-transitive cycle decompositions of tetravalent graphs
Štefko Miklavič, Primož Potočnik, Steve Wilson, 2008, izvirni znanstveni članek

Opis: 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.
Ključne besede: mathematics, graph theory, cycle decomposition, automorphism group, consistent cycle, medial maps
Objavljeno v RUP: 15.10.2013; Ogledov: 3670; Prenosov: 85
URL Povezava na celotno besedilo

40.
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$▫.
Ključne besede: graph theory, Cayley graphs, hamiltonian cycles
Objavljeno v RUP: 15.10.2013; Ogledov: 3526; Prenosov: 121
.pdf Celotno besedilo (545,91 KB)

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