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


71 - 80 / 109
Na začetekNa prejšnjo stran234567891011Na naslednjo stranNa konec
71.
72.
Nilpotent 3-BCI groups
Sergio Hiroki Koike Quintanar, István Kovács, 2014, objavljeni povzetek znanstvenega prispevka na konferenci

Ključne besede: group, nilpotent, BCI
Objavljeno v RUP: 15.10.2015; Ogledov: 2269; Prenosov: 26
URL Povezava na celotno besedilo

73.
74.
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: 2454; Prenosov: 89
URL Povezava na celotno besedilo

75.
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: 3133; Prenosov: 157
URL Povezava na celotno besedilo

76.
Automorphism groups of Cayley digraphs of Zp3
Edward Dobson, István Kovács, 2009, izvirni znanstveni članek

Ključne besede: Cayley digraph, automorphism group
Objavljeno v RUP: 15.10.2013; Ogledov: 4628; Prenosov: 27
URL Povezava na celotno besedilo

77.
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: 3531; Prenosov: 85
URL Povezava na celotno besedilo

78.
Distance-transitive graphs admit semiregular automorphisms
Klavdija Kutnar, Primož Šparl, 2010, izvirni znanstveni članek

Opis: 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.
Ključne besede: distance-transitive graph, vertex-transitive graph, semiregular automorphism, permutation group
Objavljeno v RUP: 15.10.2013; Ogledov: 3280; Prenosov: 98
URL Povezava na celotno besedilo

79.
A note on finite non-solvable groups with few non-cyclic subgroups
Jiangtao Shi, Cui Zhang, 2011, izvirni znanstveni članek

Ključne besede: finite group, non-cyclic subgroup, non-solvable group
Objavljeno v RUP: 15.10.2013; Ogledov: 2877; Prenosov: 44
URL Povezava na celotno besedilo

80.
On the order of arc-stabilizers in arc-transitive graphs
Gabriel Verret, 2009, objavljeni povzetek znanstvenega prispevka na konferenci

Ključne besede: arc-transitivie graph, arc-stabilizer, automorphism group
Objavljeno v RUP: 15.10.2013; Ogledov: 3102; Prenosov: 71
URL Povezava na celotno besedilo

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