1. Graphs and their automorphism groups bpredavanje eUnidad Cuernavaca del Instituto de Matemáticas, UNAM, Cuernavaca, Morelos, Mehika, 23. - 27. 7. 2012Klavdija Kutnar, Primož Šparl, 2012, invited lecture at foreign university Found in: ključnih besedah Summary of found: ...automorphism group, ... Keywords: automorphism group Published: 15.10.2013; Views: 1573; Downloads: 11 Full text (0,00 KB) |
2. |
3. Hamilton paths in vertex-transitive graphs of order 10pKlavdija Kutnar, Dragan Marušič, Cui Zhang, 2012, original scientific article Abstract: 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. Found in: ključnih besedah Keywords: graph, vertex-transitive, Hamilton cycle, Hamilton path, automorphism group Published: 15.10.2013; Views: 1663; Downloads: 11 Full text (0,00 KB) |
4. |
5. |
6. |
7. |
8. |
9. On non-normal arc-transitive 4-valent dihedrantsIstván Kovács, Boštjan Kuzman, Aleksander Malnič, 2010, original scientific article Abstract: 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. Found in: ključnih besedah Summary of found: ...4-valent arc-transitive Cayley graph on a dihedral group ▫$D_n$▫ such that ▫$X$▫ is bipartite, with... Keywords: Cayley graph, arc transitivity, dihedral group Published: 15.10.2013; Views: 1708; Downloads: 36 Full text (0,00 KB) |
10. Classification of 2-arc-transitive dihedrantsShao Fei Du, Aleksander Malnič, Dragan Marušič, 2008, original scientific article Abstract: 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$▫. Found in: ključnih besedah Summary of found: ...dihedrants, that is, Cayley graphs of dihedral groups is given, thus completing the study of... Keywords: permutation group, imprimitive group, dihedral group, Cayley graph, dihedrant, 2-Arc-transitive graph Published: 15.10.2013; Views: 1520; Downloads: 44 Full text (0,00 KB) |