211. Connected graphs of fixed order and size with minimal index : structural considerationsSlobodan Simić, Enzo M. Li Marzi, Francesco Belardo, 2004, izvirni znanstveni članek Ključne besede: spekter grafa, največja lastna vrednost, spektralni radij, indeks grafa, graph spectrum, largest eingenvalue, spectral radius, graph index, nested split graphs
Objavljeno v RUP: 15.10.2015; Ogledov: 3226; Prenosov: 60
 Povezava na celotno besedilo |
212. |
213. Algebraični aspekti teorije grafov : doktorska disertacijaAdemir Hujdurović, 2013, doktorska disertacija Ključne besede: circulant, bicirculant, semiregular automorphism, vertex-transitive graph, half-arc-transitive graph, snark, Cayley graph, quasi m-Cayley graph, generalized Cayley graph, I-regular action, regular cover of a graph, automorphism group
Objavljeno v RUP: 10.07.2015; Ogledov: 3492; Prenosov: 42
Povezava na celotno besedilo |
214. 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: 2601; Prenosov: 90
Povezava na celotno besedilo |
215. On overgroups of regular abelian p-groupsEdward Dobson, 2009, izvirni znanstveni članek Opis: 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.
Ključne besede: group theory, graph theory, Cayley graph, abelian group, regular group, p-group
Objavljeno v RUP: 15.10.2013; Ogledov: 3252; Prenosov: 157
Povezava na celotno besedilo |
216. |
217. |
218. Arc-transitive cycle decompositions of tetravalent graphsŠtefko Miklavič, Primož Potočnik, Steve 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.
Ključne besede: mathematics, graph theory, cycle decomposition, automorphism group, consistent cycle, medial maps
Objavljeno v RUP: 15.10.2013; Ogledov: 3701; Prenosov: 85
Povezava na celotno besedilo |
219. |
220. Hamiltonian cycles in Cayley graphs whose order has few prime factorsKlavdija Kutnar, Dragan Marušič, D. W. Morris, Joy Morris, Primož Šparl, 2012, izvirni znanstveni članek Opis: We prove that if Cay▫$(G; S)$▫ is a connected Cayley graph with ▫$n$▫ vertices, and the prime factorization of ▫$n$▫ is very small, then Cay▫$(G; S)$▫ has a hamiltonian cycle. More precisely, if ▫$p$▫, ▫$q$▫, and ▫$r$▫ are distinct primes, then ▫$n$▫ can be of the form kp with ▫$24 \ne k < 32$▫, or of the form ▫$kpq$▫ with ▫$k \le 5$▫, or of the form ▫$pqr$▫, or of the form ▫$kp^2$▫ with ▫$k \le 4$▫, or of the form ▫$kp^3$▫ with ▫$k \le 2$▫.
Ključne besede: graph theory, Cayley graphs, hamiltonian cycles
Objavljeno v RUP: 15.10.2013; Ogledov: 3544; Prenosov: 121
 Celotno besedilo (545,91 KB) |
