31. Symmetry structure of bicirculantsAleksander Malnič, Dragan Marušič, Primož Šparl, Boštjan Frelih, 2007, original scientific article Abstract: An ▫$n$▫-bicirculant is a graph having an automorphism with two orbits of length ▫$n$▫ and no other orbits. Symmetry properties of ▫$p$▫-bicirculants, ▫$p$▫ a prime, are extensively studied. In particular, the actions of their automorphism groups are described in detail in terms of certain algebraic representation of such graphs. Keywords: mathematics, graph theory, graph, circulant, bicirculant, automorphism group Published in RUP: 03.04.2017; Views: 2588; Downloads: 95 Link to full text |
32. On strongly regular bicirculantsAleksander Malnič, Dragan Marušič, Primož Šparl, 2007, original scientific article Abstract: An ▫$n$▫-bicirculantis a graph having an automorphism with two orbits of length ▫$n$▫ and no other orbits. This article deals with strongly regular bicirculants. It is known that for a nontrivial strongly regular ▫$n$▫-bicirculant, ▫$n$▫ odd, there exists a positive integer m such that ▫$n=2m^2+2m+1▫$. Only three nontrivial examples have been known previously, namely, for ▫$m=1,2$▫ and 4. Case ▫$m=1$▫ gives rise to the Petersen graph and its complement, while the graphs arising from cases ▫$m=2$▫ and ▫$m=4$▫ are associated with certain Steiner systems. Similarly, if ▫$n$▫ is even, then ▫$n=2m^2$▫ for some ▫$m \ge 2$▫. Apart from a pair of complementary strongly regular 8-bicirculants, no other example seems to be known. A necessary condition for the existence of a strongly regular vertex-transitive ▫$p$▫-bicirculant, ▫$p$▫ a prime, is obtained here. In addition, three new strongly regular bicirculants having 50, 82 and 122 vertices corresponding, respectively, to ▫$m=3,4$▫ and 5 above, are presented. These graphs are not associated with any Steiner system, and together with their complements form the first known pairs of complementary strongly regular bicirculants which are vertex-transitive but not edge-transitive. Keywords: mathematics, graph theory, graph, circulant, bicirculant, automorphism group Published in RUP: 03.04.2017; Views: 3641; Downloads: 88 Link to full text |
33. Semiregular automorphisms of vertex-transitive graphs of certain valenciesEdward Dobson, Aleksander Malnič, Dragan Marušič, Lewis A. Nowitz, 2007, original scientific article Abstract: It is shown that a vertex-transitive graph of valency ▫$p+1$▫, ▫$p$▫ a prime, admitting a transitive action of a ▫$\{2,p\}$▫-group, has a non-identity semiregular automorphism. As a consequence, it is proved that a quartic vertex-transitive graph has a non-identity semiregular automorphism, thus giving a partial affirmative answer to the conjecture that all vertex-transitive graphs have such an automorphism and, more generally, that all 2-closed transitive permutation groups contain such an element (see [D. Marušic, On vertex symmetric digraphs, Discrete Math. 36 (1981) 69-81; P.J. Cameron (Ed.), Problems from the Fifteenth British Combinatorial Conference, Discrete Math. 167/168 (1997) 605-615]). Keywords: mathematics, graph theory, transitive permutation group, 2-closed group, semiregular automorphism, vertex-transitive graph Published in RUP: 03.04.2017; Views: 2496; Downloads: 83 Link to full text |
34. |
35. Določeni razredi (hiper)grafov in njihove algebraične lastnosti : doktorska disertacijaPaweł Petecki, 2016, doctoral dissertation Keywords: hypergraph, hamiltonian cycle, decomposition, double generalized Petersen graph, automorphism group, vertex-transitive, sign graph, L-eigenvalue, lollipop graph Published in RUP: 09.08.2016; Views: 3189; Downloads: 30 Link to full text |
36. |
37. |
38. |
39. Cubic symmetric graphs via odd automorphisms, 60th Birthday Lecture Series, Department of Mathematics, University of Auckland, New Zealand, 10 September 2015Klavdija Kutnar, 2015, invited lecture at foreign university Keywords: cubic graph, symmetric, automorphism, odd permutation Published in RUP: 15.10.2015; Views: 2588; Downloads: 23 Link to full text |
40. |