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


1 - 10 / 57
Na začetekNa prejšnjo stran123456Na naslednjo stranNa konec
1.
Hamilton paths in vertex-transitive graphs of order 10p
Klavdija Kutnar, Dragan Marušič, Cui Zhang, 2012, izvirni znanstveni članek

Opis: It is shown that every connected vertex-transitive graph of order ▫$10p$▫, ▫$p \ne 7$▫ a prime, which is not isomorphic to a quasiprimitive graph arising from the action of PSL▫$(2,k)$▫ on cosets of ▫$\mathbb{Z}_k \times \mathbb{Z}_{(k-1)/10}$▫, contains a Hamilton path.
Najdeno v: ključnih besedah
Ključne besede: graph, vertex-transitive, Hamilton cycle, Hamilton path, automorphism group
Objavljeno: 15.10.2013; Ogledov: 1691; Prenosov: 11
URL Polno besedilo (0,00 KB)

2.
On the order of arc-stabilisers in arc-transitive graphs, II
Gabriel Verret, 2013, izvirni znanstveni članek

Najdeno v: ključnih besedah
Povzetek najdenega: ...arc-transitive graphs, graph-restrictive group, local action, ...
Ključne besede: arc-transitive graphs, graph-restrictive group, local action
Objavljeno: 15.10.2013; Ogledov: 1959; Prenosov: 42
URL Polno besedilo (0,00 KB)

3.
Hamiltonicity of vertex-transitive graphs of order 4p
Klavdija Kutnar, Dragan Marušič, 2008, izvirni znanstveni članek

Opis: It is shown that every connected vertex-transitive graph of order ▫$4p$▫, where ▫$p$▫ is a prime, is hamiltonian with the exception of the Coxeter graph which is known to possess a Hamilton path.
Najdeno v: ključnih besedah
Ključne besede: graph theory, vertex-transitive graphs, Hamilton cycle, automorphism group
Objavljeno: 15.10.2013; Ogledov: 1579; Prenosov: 17
URL Polno besedilo (0,00 KB)

4.
The full automorphism group of Cayley graphs of ${mathbb Z}_ptimes{mathbbZ}_{p^2}$
Edward Dobson, 2012, izvirni znanstveni članek

Najdeno v: ključnih besedah
Ključne besede: Cayley graph, abelian group, automorphism group
Objavljeno: 15.10.2013; Ogledov: 1735; Prenosov: 31
URL Polno besedilo (0,00 KB)

5.
On non-normal arc-transitive 4-valent dihedrants
István Kovács, Boštjan Kuzman, Aleksander Malnič, 2010, izvirni znanstveni članek

Opis: Let ▫$X$▫ be a connected non-normal 4-valent arc-transitive Cayley graph on a dihedral group ▫$D_n$▫ such that ▫$X$▫ is bipartite, with the two bipartition sets being the two orbits of the cyclic subgroup within ▫$D_n$▫. It is shown that ▫$X$▫ is isomorphic either to the lexicographic product ▫$C_n[2K_1]$▫ with ▫$n \geq 4$▫ even, or to one of the five sporadic graphs on 10, 14, 26, 28 and 30 vertices, respectively.
Najdeno v: ključnih besedah
Povzetek najdenega: ...4-valent arc-transitive Cayley graph on a dihedral group ▫$D_n$▫ such that ▫$X$▫ is bipartite, with...
Ključne besede: Cayley graph, arc transitivity, dihedral group
Objavljeno: 15.10.2013; Ogledov: 1743; Prenosov: 38
URL Polno besedilo (0,00 KB)

6.
Classification of 2-arc-transitive dihedrants
Shao Fei Du, Aleksander Malnič, Dragan Marušič, 2008, izvirni znanstveni članek

Opis: A complete classification of 2-arc-transitive dihedrants, that is, Cayley graphs of dihedral groups is given, thus completing the study of these graphs initiated by the third author in [D. Marušič, On 2-arc-transitivity of Cayley graphs, J. Combin. Theory Ser. B 87 (2003) 162-196]. The list consists of the following graphs: (i) cycles ▫$C_{2n},\; n \ge 3$▫; (ii) complete graphs ▫$K_{2n}, \; n \ge 3$▫; (iii) complete bipartite graphs ▫$K_{n,n}, \; n \ge 3$▫; (iv) complete bipartite graphs minus a matching ▫$K_{n,n} - nK_2, \; n \ge 3$▫; (v) incidence and nonincidence graphs ▫$B(H_{11})$▫ and ▫$B'(H_{11})$▫ of the Hadamard design on 11 points; (vi) incidence and nonincidence graphs ▫$B(PG(d,q))$▫ and ▫$B'(PG(d,q))$▫, with ▫$d \ge 2$▫ and ▫$q$▫ a prime power, of projective spaces; (vii) and an infinite family of regular ▫${\mathbb{Z}}_d$▫-covers ▫$K_{q+1}^{2d}$▫ of ▫$K_{q+1, q+1} - (q+1)K_2$▫, where ▫$q \ge 3$▫ is an odd prime power and ▫$d$▫ is a divisor of ▫$\frac{q-1}{2}$▫ and ▫$q-1$▫, respectively, depending on whether ▫$q \equiv 1 \pmod{4}$▫ or ▫$q \equiv 3 \pmod{4}$▫ obtained by identifying the vertex set of the base graph with two copies of the projective line ▫$PG(1,q)$▫, where the missing matching consists of all pairs of the form ▫$[i,i']$▫, ▫$i \in PG(1,q)$▫, and the edge ▫$[i,j']$▫ carries trivial voltage if ▫$i=\infty$▫ or ▫$j=\infty$▫, and carries voltage ▫$\bar{h} \in {\mathbb{Z}}_d$▫, the residue class of ▫$h \in {\mathbb{Z}}_d$▫, if and only if ▫$i-j = \theta^h$▫, where ▫$\theta$▫ generates the multiplicative group ▫${\mathbb{F}}_q^\ast$▫ of the Galois field ▫${\mathbb{F}}_q$▫.
Najdeno v: ključnih besedah
Povzetek najdenega: ...dihedrants, that is, Cayley graphs of dihedral groups is given, thus completing the study of...
Ključne besede: permutation group, imprimitive group, dihedral group, Cayley graph, dihedrant, 2-Arc-transitive graph
Objavljeno: 15.10.2013; Ogledov: 1551; Prenosov: 46
URL Polno besedilo (0,00 KB)

7.
Primitive groups of degree twice a prime number
Dragan Marušič, 2012, vabljeno predavanje na konferenci brez natisa

Najdeno v: ključnih besedah
Povzetek najdenega: ...primitive group, strongly regular graph, primitive action, ...
Ključne besede: primitive group, strongly regular graph, primitive action
Objavljeno: 15.10.2013; Ogledov: 1575; Prenosov: 23
URL Polno besedilo (0,00 KB)

8.
On quartic half-arc-transitive metacirculants
Dragan Marušič, Primož Šparl, 2008, izvirni znanstveni članek

Opis: Following Alspach and Parsons, a metacirculant graph is a graph admitting a transitive group generated by two automorphisms ▫$\rho$▫ and ▫$\sigma$▫, where ▫$\rho$▫ is ▫$(m,n)$▫-semiregular for some integers ▫$m \ge 1$▫, ▫$n \ge 2▫$, and where ▫$\sigma$▫ normalizes ▫$\rho$▫, cyclically permuting the orbits of ▫$\rho$▫ in such a way that ▫$\sigma^m$▫ has at least one fixed vertex. A half-arc-transitive graph is a vertex- and edge- but not arc-transitive graph. In this article quartic half-arc-transitive metacirculants are explored and their connection to the so called tightly attached quartic half-arc-transitive graphs is explored. It is shown that there are three essentially different possibilities for a quartic half-arc-transitive metacirculant which is not tightly attached to exist. These graphs are extensively studied and some infinite families of such graphs are constructed.
Najdeno v: ključnih besedah
Povzetek najdenega: ...graph is a graph admitting a transitive group generated by two automorphisms ▫$\rho$▫ and ▫$\sigma$▫,...
Ključne besede: mathematics, graph theory, metacirculant graph, half-arc-transitive graph, tightly attached, automorphism group
Objavljeno: 15.10.2013; Ogledov: 1635; Prenosov: 57
URL Polno besedilo (0,00 KB)

9.
The full automorphism group of a Cayley graph
Gabriel Verret, 2013, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje)

Najdeno v: ključnih besedah
Ključne besede: automorphism group, Cayley graph
Objavljeno: 15.10.2013; Ogledov: 2238; Prenosov: 19
URL Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...

10.
Distance-regular Cayley graphs on dihedral groups
Štefko Miklavič, Primož Potočnik, 2007, 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: ...classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious families of such...
Ključne besede: mathematics, grah theory, distance-regular graph, distance-transitive graph, Cayley graph, dihedral group, dihedrant, difference set
Objavljeno: 15.10.2013; Ogledov: 1232; Prenosov: 54
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