Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bolonia study programme

Options:
  Reset


61 - 70 / 191
First pagePrevious page3456789101112Next pageLast page
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, published scientific conference contribution abstract

Found in: ključnih besedah
Summary of found: ...diameter-degree problem, Cayley graph, projective space, ...
Keywords: diameter-degree problem, Cayley graph, projective space
Published: 15.10.2013; Views: 1780; Downloads: 12
URL Full text (0,00 KB)

62.
On overgroups of regular abelian p-groups
Edward Dobson, 2009, original scientific article

Abstract: 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.
Found in: ključnih besedah
Summary of found: ...group theory, graph theory, Cayley graph, abelian group, regular group,...
Keywords: group theory, graph theory, Cayley graph, abelian group, regular group, p-group
Published: 15.10.2013; Views: 1604; Downloads: 67
URL Full text (0,00 KB)

63.
Distance-regular Cayley graphs on dihedral groups
Primož Potočnik, Štefko Miklavič, 2005, original scientific article

Abstract: 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.
Found in: ključnih besedah
Summary of found: ...article is a classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious...
Keywords: mathematics, grah theory, distance-regular graph, distance-transitive graph, Cayley graph, dihedral group, dihedrant, difference set
Published: 10.07.2015; Views: 899; Downloads: 49
URL Full text (0,00 KB)

64.
Algebraični aspekti teorije grafov
Ademir Hujdurović, 2013, doctoral dissertation

Found in: ključnih besedah
Summary of found: ...circulant, bicirculant, semiregular automorphism, vertex-transitive graph, half- arc-transitive graph, snark, Cayley graph, quasi m-Cayley graph,...
Keywords: 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
Published: 10.07.2015; Views: 1593; Downloads: 4
URL Full text (0,00 KB)

65.
Trees with minimal index and diameter at most four
Francesco Belardo, Enzo M. Li Marzi, Slobodan Simić, 2010, published scientific conference contribution

Found in: ključnih besedah
Summary of found: ...eigenvalues, graph index, trees, ...
Keywords: eigenvalues, graph index, trees
Published: 15.10.2015; Views: 894; Downloads: 110
URL Full text (0,00 KB)

66.
Connected graphs of fixed order and size with minimal index
Francesco Belardo, Enzo M. Li Marzi, Slobodan Simić, 2004, original scientific article

Found in: ključnih besedah
Summary of found: ...največja lastna vrednost, spektralni radij, indeks grafa, graph spectrum, largest eingenvalue, spectral radius, graph index,...
Keywords: spekter grafa, največja lastna vrednost, spektralni radij, indeks grafa, graph spectrum, largest eingenvalue, spectral radius, graph index, nested split graphs
Published: 15.10.2015; Views: 1276; Downloads: 20
URL Full text (0,00 KB)

67.
On the Laplacian coefficients of signed graphs
Francesco Belardo, Slobodan Simić, 2015, original scientific article

Found in: ključnih besedah
Summary of found: ...označeni grafi, Laplacijevi koeficienti, graf povezav, signed graph, Laplacian coefficients, line graph, ...
Keywords: označeni grafi, Laplacijevi koeficienti, graf povezav, signed graph, Laplacian coefficients, line graph
Published: 15.10.2015; Views: 1332; Downloads: 104
URL Full text (0,00 KB)

68.
Some results on the index of unicyclic graphs
Francesco Belardo, Enzo M. Li Marzi, Slobodan Simić, 2006, original scientific article

Found in: ključnih besedah
Summary of found: ... graph eigenvalues, graph index, unicyclic graphs, ...
Keywords: graph eigenvalues, graph index, unicyclic graphs
Published: 15.10.2015; Views: 890; Downloads: 87
URL Full text (0,00 KB)

69.
On hereditary efficiently dominatable graphs
Martin Milanič, 2011, published scientific conference contribution abstract

Found in: ključnih besedah
Summary of found: ...razredi, perfect code, efficient domination, efficiently dominatable graphs, polynomial time algorithms, hereditary graph classes, ...
Keywords: 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
Published: 15.10.2015; Views: 1460; Downloads: 112
URL Full text (0,00 KB)
This document has more files! More...

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

Found in: ključnih besedah
Summary of found: ...bipartite distance-regular graph, Q-polynomial property, equitable partition, ...
Keywords: bipartite distance-regular graph, Q-polynomial property, equitable partition
Published: 15.10.2015; Views: 1124; Downloads: 29
URL Full text (0,00 KB)

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica