1. Vertex-transitive expansions of (1, 3)-treesMarko Lovrečič Saražin, Dragan Marušič, 2010, published scientific conference contribution Abstract: A nonidentity automorphism of a graph is said to be semiregular if all of its orbits are of the same length. Given a graph ▫$X$▫ with a semiregular automorphism ▫$\gamma$▫, the quotient of ▫$X$▫ relative to ▫$\gamma$▫ is the multigraph ▫$X/\gamma$▫ whose vertices are the orbits of ▫$\gamma$▫ and two vertices are adjacent by an edge with multiplicity ▫$r$▫ if every vertex of one orbit is adjacent to ▫$r$▫ vertices of the other orbit. We say that ▫$X$▫ is an expansion of ▫$X/\gamma$▫. In [J.D. Horton, I.Z. Bouwer, Symmetric ▫$Y$▫-graphs and ▫$H$▫-graphs, J. Combin. Theory Ser. B 53 (1991) 114-129], Hortonand Bouwer considered a restricted sort of expansions (which we will call :strong" in this paper) where every leaf of ▫$X/\gamma$▫ expands to a single cycle in ▫$X$▫. They determined all cubic arc-transitive strong expansions of simple ▫$(1,3)$▫-trees, that is, trees with all of their vertice shaving valency 1 or 3, thus extending the classical result of Frucht, Graver and Watkins (see [R. Frucht, J.E. Graver, M.E. Watkins, The groups of the generalized Petersen graphs, Proc. Cambridge Philos. Soc. 70 (1971) 211-218]) about arc-transitive strong expansions of ▫$K_2$▫ (also known as the generalized Petersen graphs). In this paper another step is taken further by considering the possible structure of cubic vertex-transitive expansions of general ▫$(1,3)$▫-multitrees (where vertices with double edges are also allowed); thus the restriction on every leaf to be expanded to a single cycle is dropped. Found in: osebi Keywords: graph, tree, cubic, vertex-transitive, arc-transitive, expansion Published: 15.10.2013; Views: 1789; Downloads: 28 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: osebi Keywords: graph, vertex-transitive, Hamilton cycle, Hamilton path, automorphism group Published: 15.10.2013; Views: 1626; Downloads: 11 Full text (0,00 KB) |
4. |
5. On prime-valent symmetric bicirculants and Cayley snarksAdemir Hujdurović, Klavdija Kutnar, Dragan Marušič, 2013, published scientific conference contribution Found in: osebi Keywords: graph, Cayley graph, arc-transitive, snark, semiregular automorphism, bicirculant Published: 15.10.2013; Views: 1496; Downloads: 58 Full text (0,00 KB) |
6. |
7. |
8. Distance-balanced graphs: Symmetry conditionsKlavdija Kutnar, Aleksander Malnič, Dragan Marušič, Štefko Miklavič, 2006, original scientific article Abstract: A graph ▫$X$▫ is said to be distance-balanced if for any edge ▫$uv$▫ of ▫$X$▫, the number of vertices closer to ▫$u$▫ than to ▫$v$▫ is equal to the number of vertices closer to ▫$v$▫ than to ▫$u$▫. A graph ▫$X$▫ is said to be strongly distance-balanced if for any edge ▫$uv$▫ of ▫$X$▫ and any integer ▫$k$▫, the number of vertices at distance ▫$k$▫ from ▫$u$▫ and at distance ▫$k+1$▫ from ▫$v$▫ is equal to the number of vertices at distance ▫$k+1$▫ from ▫$u$▫ and at distance ▫$k$▫ from ▫$v$▫. Exploring the connection between symmetry properties of graphs and the metric property of being (strongly) distance-balanced is the main theme of this article. That a vertex-transitive graph is necessarily strongly distance-balanced and thus also distance-balanced is an easy observation. With only a slight relaxation of the transitivity condition, the situation changes drastically: there are infinite families of semisymmetric graphs (that is, graphs which are edge-transitive, but not vertex-transitive) which are distance-balanced, but there are also infinite families of semisymmetric graphs which are not distance-balanced. Results on the distance-balanced property in product graphs prove helpful in obtaining these constructions. Finally, a complete classification of strongly distance-balanced graphs is given for the following infinite families of generalized Petersen graphs: GP▫$(n,2)$▫, GP▫$(5k+1,k)$▫, GP▫$(3k 3,k)$▫, and GP▫$(2k+2,k)$▫. Found in: osebi Keywords: graph theory, graph, distance-balanced graphs, vertex-transitive, semysimmetric, generalized Petersen graph Published: 15.10.2013; Views: 1723; Downloads: 29 Full text (0,00 KB) |
9. 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: osebi Summary of found: ...initiated by the third author in [D. Marušič, On 2-arc-transitivity of Cayley graphs, J. Combin.... Keywords: permutation group, imprimitive group, dihedral group, Cayley graph, dihedrant, 2-Arc-transitive graph Published: 15.10.2013; Views: 1477; Downloads: 30 Full text (0,00 KB) |
10. A complete classification of cubic symmetric graphs of girth 6Klavdija Kutnar, Dragan Marušič, 2009, original scientific article Abstract: A complete classification of cubic symmetric graphs of girth 6 is given. It is shown that with the exception of the Heawood graph, the Moebius-Kantor graph, the Pappus graph, and the Desargues graph, a cubic symmetric graph ▫$X$▫ of girth 6 is a normal Cayley graph of a generalized dihedral group; in particular, (i) ▫$X$▫ is 2-regular if and only if it is isomorphic to a so-called ▫$I_k^n$▫-path, a graph of order either ▫$n^2/2$▫ or ▫$n^2/6$▫, which is characterized by the fact that its quotient relative to a certain semiregular automorphism is a path. (ii) ▫$X$▫ is 1-regular if and only if there exists an integer ▫$r$▫ with prime decomposition ▫$r=3^s p_1^{e_1} \dots p_t^{e_t} > 3$▫, where ▫$s \in \{0,1\}$▫, ▫$t \ge 1$▫, and ▫$p_i \equiv 1 \pmod{3}$▫, such that ▫$X$▫ is isomorphic either to a Cayley graph of a dihedral group ▫$D_{2r}$▫ of order ▫$2r$▫ or ▫$X$▫ is isomorphic to a certain ▫$\ZZ_r$▫-cover of one of the following graphs: the cube ▫$Q_3$▫, the Pappus graph or an ▫$I_k^n(t)$▫-path of order ▫$n^2/2$▫. Found in: osebi Keywords: graph theory, cubic graphs, symmetric graphs, ▫$s$▫-regular graphs, girth, consistent cycle Published: 15.10.2013; Views: 1725; Downloads: 26 Full text (0,00 KB) |