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


51 - 60 / 81
Na začetekNa prejšnjo stran123456789Na naslednjo stranNa konec
51.
Symmetry of graphs via even/odd automorphisms
Dragan Marušič, Klavdija Kutnar, 2016, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Ključne besede: vertex-transitive, graph, odd automorphism, automorphism group
Objavljeno v RUP: 08.08.2016; Ogledov: 2182; Prenosov: 27
URL Povezava na celotno besedilo

52.
Odd automorphism in vertex-transitive graphs
Klavdija Kutnar, Ademir Hujdurović, Dragan Marušič, 2016, objavljeni povzetek znanstvenega prispevka na konferenci

Ključne besede: vertex-transitive, graph, odd automorphism, even-closed
Objavljeno v RUP: 08.08.2016; Ogledov: 2472; Prenosov: 15
URL Povezava na celotno besedilo

53.
Vertex-transitive graphs : why semiregularity matters
Dragan Marušič, 2016, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Ključne besede: vertex-transitive, graph, semiregular
Objavljeno v RUP: 08.08.2016; Ogledov: 2362; Prenosov: 29
URL Povezava na celotno besedilo

54.
55.
56.
57.
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: 2566; Prenosov: 90
URL Povezava na celotno besedilo

58.
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: 3379; Prenosov: 98
URL Povezava na celotno besedilo

59.
60.
Cubic Cayley graphs and snarks
Klavdija Kutnar, Ademir Hujdurović, Dragan Marušič, 2012, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Ključne besede: Cayley graph, snark, arc-transitive graph, Cayley map
Objavljeno v RUP: 15.10.2013; Ogledov: 3005; Prenosov: 82
URL Povezava na celotno besedilo

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