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


11 - 13 / 13
Na začetekNa prejšnjo stran12Na naslednjo stranNa konec
11.
A complete classification of cubic symmetric graphs of girth 6
Klavdija Kutnar, Dragan Marušič, 2009, izvirni znanstveni članek

Opis: A complete classification of cubic symmetric graphs of girth 6 is given. It is shown that with the exception of the Heawood graph, the Moebius-Kantor graph, the Pappus graph, and the Desargues graph, a cubic symmetric graph ▫$X$▫ of girth 6 is a normal Cayley graph of a generalized dihedral group; in particular, (i) ▫$X$▫ is 2-regular if and only if it is isomorphic to a so-called ▫$I_k^n$▫-path, a graph of order either ▫$n^2/2$▫ or ▫$n^2/6$▫, which is characterized by the fact that its quotient relative to a certain semiregular automorphism is a path. (ii) ▫$X$▫ is 1-regular if and only if there exists an integer ▫$r$▫ with prime decomposition ▫$r=3^s p_1^{e_1} \dots p_t^{e_t} > 3$▫, where ▫$s \in \{0,1\}$▫, ▫$t \ge 1$▫, and ▫$p_i \equiv 1 \pmod{3}$▫, such that ▫$X$▫ is isomorphic either to a Cayley graph of a dihedral group ▫$D_{2r}$▫ of order ▫$2r$▫ or ▫$X$▫ is isomorphic to a certain ▫$\ZZ_r$▫-cover of one of the following graphs: the cube ▫$Q_3$▫, the Pappus graph or an ▫$I_k^n(t)$▫-path of order ▫$n^2/2$▫.
Ključne besede: graph theory, cubic graphs, symmetric graphs, ▫$s$▫-regular graphs, girth, consistent cycle
Objavljeno v RUP: 15.10.2013; Ogledov: 4048; Prenosov: 86
URL Povezava na celotno besedilo

12.
The A-like matrices for a Hypercubes
Štefko Miklavič, Paul Terwilliger, 2011, izvirni znanstveni članek

Ključne besede: A-like matrices, distance-regular graphs, Hypercubes
Objavljeno v RUP: 15.10.2013; Ogledov: 3513; Prenosov: 73
URL Povezava na celotno besedilo

13.
On bipartite Q-polynomial distance-regular graphs with c [sub] 2 [equal] 1
Štefko Miklavič, 2007, izvirni znanstveni članek

Opis: Let ▫$\Gamma$▫ denote a bipartite ▫$Q$▫-polynomial distance-regular graph with diameter ▫$d \ge 3$▫, valency ▫$k \ge 3$▫ and intersection number ▫$c_2=1$▫. We show that ▫$\Gamma$▫ has a certain equitable partition of its vertex set which involves ▫$4d-4$▫ cells. We use this partition to show that the intersection numbers of ▫$\Gamma$▫ satisfy the following divisibility conditions: (I) ▫$c_{i+1}-1$▫ divides ▫$c_i(c_i-1)$▫ for ▫$2 \le i \le d-1$▫, and (II) ▫$b_{i-1}-1$▫ divides ▫$b_i(b_i-1)$▫ for ▫$1 \le i \le d-1$▫. Using these divisibility conditions we show that ▫$\Gamma$▫ does not exist if ▫$d=4$▫.
Ključne besede: mathematics, grah theory, distance-regular graphs, ▫$Q$▫-polynomial property, equitable partitions
Objavljeno v RUP: 15.10.2013; Ogledov: 4047; Prenosov: 37
URL Povezava na celotno besedilo

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