Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


71 - 80 / 109
First pagePrevious page234567891011Next pageLast page
71.
72.
Nilpotent 3-BCI groups
Sergio Hiroki Koike Quintanar, István Kovács, 2014, published scientific conference contribution abstract

Keywords: group, nilpotent, BCI
Published in RUP: 15.10.2015; Views: 2269; Downloads: 26
URL Link to full text

73.
74.
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: 2454; Downloads: 89
URL Link to full text

75.
On overgroups of regular abelian p-groups
Edward 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: 3133; Downloads: 157
URL Link to full text

76.
Automorphism groups of Cayley digraphs of Zp3
Edward Dobson, István Kovács, 2009, original scientific article

Keywords: Cayley digraph, automorphism group
Published in RUP: 15.10.2013; Views: 4653; Downloads: 27
URL Link to full text

77.
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: 3532; Downloads: 85
URL Link to full text

78.
Distance-transitive graphs admit semiregular automorphisms
Klavdija Kutnar, Primož Šparl, 2010, original scientific article

Abstract: 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.
Keywords: distance-transitive graph, vertex-transitive graph, semiregular automorphism, permutation group
Published in RUP: 15.10.2013; Views: 3282; Downloads: 98
URL Link to full text

79.
A note on finite non-solvable groups with few non-cyclic subgroups
Jiangtao Shi, Cui Zhang, 2011, original scientific article

Keywords: finite group, non-cyclic subgroup, non-solvable group
Published in RUP: 15.10.2013; Views: 2877; Downloads: 44
URL Link to full text

80.
On the order of arc-stabilizers in arc-transitive graphs
Gabriel Verret, 2009, published scientific conference contribution abstract

Keywords: arc-transitivie graph, arc-stabilizer, automorphism group
Published in RUP: 15.10.2013; Views: 3103; Downloads: 71
URL Link to full text

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica