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


21 - 30 / 51
Na začetekNa prejšnjo stran123456Na naslednjo stranNa konec
21.
Rotary polygons in configurations
Marko Boben, Štefko Miklavič, Primož Potočnik, 2011, izvirni znanstveni članek

Najdeno v: osebi
Ključne besede: konfiguracija, poligon, avtomorfizem, antiavtomorfizem
Objavljeno: 15.10.2013; Ogledov: 1475; Prenosov: 23
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

22.
Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups
Štefko Miklavič, Primož Šparl, 2012, izvirni znanstveni članek

Opis: In this paper the concepts of Hamilton cycle (HC) and Hamilton path (HP) extendability are introduced. A connected graph ▫$\Gamma$▫ is ▫$n$▫-HC-extendable if it contains a path of length ▫$n$▫ and if every such path is contained in some Hamilton cycle of ▫$\Gamma$▫. Similarly, ▫$\Gamma$▫ is weakly ▫$n$▫-HP-extendable if it contains a path of length ▫$n$▫ and if every such path is contained in some Hamilton path of ▫$\Gamma$▫. Moreover, ▫$\Gamma$▫ is strongly ▫$n$▫-HP-extendable if it contains a path of length ▫$n$▫ and if for every such path $P$ there is a Hamilton path of ▫$\Gamma$▫ starting with ▫$P$▫. These concepts are then studied for the class of connected Cayley graphs on abelian groups. It is proved that every connected Cayley graph on an abelian group of order at least three is 2-HC-extendable and a complete classification of 3-HC-extendable connected Cayley graphs of abelian groups is obtained. Moreover, it is proved that every connected Cayley graph on an abelian group of order at least five is weakly 4-HP-extendable.
Najdeno v: osebi
Ključne besede: graph theory, Hamilton cycle, Hamilton path, n-HC-extendable, strongly n-HP-extendable, weakly n-HP-extendable, Cayley graph, abelian group
Objavljeno: 15.10.2013; Ogledov: 1318; Prenosov: 82
URL Polno besedilo (0,00 KB)

23.
On vertex-stabilizers of bipartite dual polar graphs
Štefko Miklavič, 2010, izvirni znanstveni članek

Opis: Let ▫$X,Y$▫ denote vertices of a bipartite dual polar graph, and let ▫$G_X$▫ and ▫$G_Y$▫ denote the stabilizers of ▫$X$▫ and ▫$Y$▫ in the full automorphism group of this graph. In this paper, a description of the orbits of ▫$G_X \cap G_Y$▫ in the cases when the distance between ▫$X$▫ and ▫$Y$▫ is 1 or 2, is given.
Najdeno v: osebi
Ključne besede: dual polar graphs, automorphism group, quadratic form, isotropic subspace
Objavljeno: 15.10.2013; Ogledov: 1429; Prenosov: 66
URL Polno besedilo (0,00 KB)

24.
Leonard triples and hypercubes
Štefko Miklavič, 2007, predavanje na tuji univerzi

Najdeno v: osebi
Objavljeno: 15.10.2013; Ogledov: 724; Prenosov: 53
URL Polno besedilo (0,00 KB)

25.
Arc-transitive cycle decompositions of tetravalent graphs
Štefko Miklavič, Primož Potočnik, Stephen 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.
Najdeno v: osebi
Ključne besede: mathematics, graph theory, cycle decomposition, automorphism group, consistent cycle, medial maps
Objavljeno: 15.10.2013; Ogledov: 1490; Prenosov: 54
URL Polno besedilo (0,00 KB)

26.
Edge regular graph products
Boštjan Frelih, Štefko Miklavič, 2013, izvirni znanstveni članek

Najdeno v: osebi
Ključne besede: edge regular graph, strong product, lexicographic product, deleted lexicographic product, co-normal product
Objavljeno: 15.10.2013; Ogledov: 1360; Prenosov: 28
URL Polno besedilo (0,00 KB)

27.
Distance-regular Cayley graphs on dihedral groups
Primož Potočnik, Štefko Miklavič, 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.
Najdeno v: osebi
Ključne besede: mathematics, grah theory, distance-regular graph, distance-transitive graph, Cayley graph, dihedral group, dihedrant, difference set
Objavljeno: 10.07.2015; Ogledov: 927; Prenosov: 52
URL Polno besedilo (0,00 KB)

28.
Verjetnostni algoritmi za testiranje praštevilskosti
Tjaša Jogan, 2014, diplomsko delo

Najdeno v: osebi
Ključne besede: praštevila, aritmetične funkcije, kongruence, Fermatov algoritem, Miller-Rabinov algoritem, Lucasov algoritem
Objavljeno: 10.07.2015; Ogledov: 981; Prenosov: 8
URL Polno besedilo (0,00 KB)

29.
30.
On bipartite Q-polynomial distance-regular graphs with c[sub]2 le 2
Štefko Miklavič, Safet Penjić, 2014, izvirni znanstveni članek

Najdeno v: osebi
Ključne besede: bipartite distance-regular graph, Q-polynomial property, equitable partition
Objavljeno: 15.10.2015; Ogledov: 1145; Prenosov: 30
URL Polno besedilo (0,00 KB)

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