Lupa

Search the repository Help

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

Options:
  Reset


51 - 60 / 81
First pagePrevious page123456789Next pageLast page
51.
Symmetry of graphs via even/odd automorphisms
Dragan Marušič, Klavdija Kutnar, 2016, published scientific conference contribution abstract (invited lecture)

Keywords: vertex-transitive, graph, odd automorphism, automorphism group
Published in RUP: 08.08.2016; Views: 2182; Downloads: 27
URL Link to full text

52.
Odd automorphism in vertex-transitive graphs
Klavdija Kutnar, Ademir Hujdurović, Dragan Marušič, 2016, published scientific conference contribution abstract

Keywords: vertex-transitive, graph, odd automorphism, even-closed
Published in RUP: 08.08.2016; Views: 2472; Downloads: 15
URL Link to full text

53.
Vertex-transitive graphs : why semiregularity matters
Dragan Marušič, 2016, published scientific conference contribution abstract (invited lecture)

Keywords: vertex-transitive, graph, semiregular
Published in RUP: 08.08.2016; Views: 2363; Downloads: 29
URL Link to full text

54.
55.
56.
57.
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: 2575; Downloads: 90
URL Link to full text

58.
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: 3381; Downloads: 98
URL Link to full text

59.
60.
Cubic Cayley graphs and snarks
Klavdija Kutnar, Ademir Hujdurović, Dragan Marušič, 2012, published scientific conference contribution abstract (invited lecture)

Keywords: Cayley graph, snark, arc-transitive graph, Cayley map
Published in RUP: 15.10.2013; Views: 3005; Downloads: 82
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