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


61 - 70 / 187
Na začetekNa prejšnjo stran3456789101112Na naslednjo stranNa konec
61.
A note on a geometric construction of large Cayley graps of given degree and diameter
György Kiss, István Kovács, Klavdija Kutnar, János Ruff, Primož Šparl, 2008, objavljeni povzetek znanstvenega prispevka na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: ...diameter-degree problem, Cayley graph, projective space, ...
Ključne besede: diameter-degree problem, Cayley graph, projective space
Objavljeno: 15.10.2013; Ogledov: 1689; Prenosov: 11
URL Polno besedilo (0,00 KB)

62.
On overgroups of regular abelian p-groups
Edward 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.
Najdeno v: ključnih besedah
Povzetek najdenega: ...group theory, graph theory, Cayley graph, abelian group, regular group,...
Ključne besede: group theory, graph theory, Cayley graph, abelian group, regular group, p-group
Objavljeno: 15.10.2013; Ogledov: 1523; Prenosov: 54
URL Polno besedilo (0,00 KB)

63.
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: ključnih besedah
Povzetek najdenega: ...article is a classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious...
Ključne besede: mathematics, grah theory, distance-regular graph, distance-transitive graph, Cayley graph, dihedral group, dihedrant, difference set
Objavljeno: 10.07.2015; Ogledov: 831; Prenosov: 39
URL Polno besedilo (0,00 KB)

64.
Algebraični aspekti teorije grafov
Ademir Hujdurović, 2013, doktorska disertacija

Najdeno v: ključnih besedah
Povzetek najdenega: ...circulant, bicirculant, semiregular automorphism, vertex-transitive graph, half-arc-transitive graph, snark, Cayley graph, quasi m-Cayley...
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: 10.07.2015; Ogledov: 1513; Prenosov: 4
URL Polno besedilo (0,00 KB)

65.
Trees with minimal index and diameter at most four
Francesco Belardo, Enzo M. Li Marzi, Slobodan Simić, 2010, objavljeni znanstveni prispevek na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: ...eigenvalues, graph index, trees, ...
Ključne besede: eigenvalues, graph index, trees
Objavljeno: 15.10.2015; Ogledov: 818; Prenosov: 77
URL Polno besedilo (0,00 KB)

66.
Connected graphs of fixed order and size with minimal index
Francesco Belardo, Enzo M. Li Marzi, Slobodan Simić, 2004, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...največja lastna vrednost, spektralni radij, indeks grafa, graph spectrum, largest eingenvalue, spectral radius, graph index,...
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: 15.10.2015; Ogledov: 934; Prenosov: 18
URL Polno besedilo (0,00 KB)

67.
On the Laplacian coefficients of signed graphs
Francesco Belardo, Slobodan Simić, 2015, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...označeni grafi, Laplacijevi koeficienti, graf povezav, signed graph, Laplacian coefficients, line graph, ...
Ključne besede: označeni grafi, Laplacijevi koeficienti, graf povezav, signed graph, Laplacian coefficients, line graph
Objavljeno: 15.10.2015; Ogledov: 1252; Prenosov: 70
URL Polno besedilo (0,00 KB)

68.
Some results on the index of unicyclic graphs
Francesco Belardo, Enzo M. Li Marzi, Slobodan Simić, 2006, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ... graph eigenvalues, graph index, unicyclic graphs, ...
Ključne besede: graph eigenvalues, graph index, unicyclic graphs
Objavljeno: 15.10.2015; Ogledov: 793; Prenosov: 53
URL Polno besedilo (0,00 KB)

69.
On hereditary efficiently dominatable graphs
Martin Milanič, 2011, objavljeni povzetek znanstvenega prispevka na konferenci

Najdeno v: ključnih besedah
Povzetek najdenega: ...razredi, perfect code, efficient domination, efficiently dominatable graphs, polynomial time algorithms, hereditary graph classes, ...
Ključne besede: popolna koda, učinkovita dominacija, grafi z učinkovito dominantno množico, polinomski algoritmi, hereditarni grafovski razredi, perfect code, efficient domination, efficiently dominatable graphs, polynomial time algorithms, hereditary graph classes
Objavljeno: 15.10.2015; Ogledov: 1290; Prenosov: 92
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

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

Najdeno v: ključnih besedah
Povzetek najdenega: ...bipartite distance-regular graph, Q-polynomial property, equitable partition, ...
Ključne besede: bipartite distance-regular graph, Q-polynomial property, equitable partition
Objavljeno: 15.10.2015; Ogledov: 1035; Prenosov: 27
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