Lupa

Search the repository Help

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

Options:
  Reset


1 - 10 / 52
First pagePrevious page123456Next pageLast page
1.
2.
Semiregular automorphisms in vertex-transitive graphs with a solvable group of automorphisms
Dragan Marušič, 2017, original scientific article

Abstract: It has been conjectured that automorphism groups of vertex-transitive (di)graphs, and more generally 2-closures of transitive permutation groups, must necessarily possess a fixed-point-free element of prime order, and thus a non-identity element with all orbits of the same length, in other words, a semiregular element. The known affirmative answers for graphs with primitive and quasiprimitive groups of automorphisms suggest that solvable groups need to be considered if one is to hope for a complete solution of this conjecture. It is the purpose of this paper to present an overview of known results and suggest possible further lines of research towards a complete solution of the problem.
Keywords: solvable group, semiregular automorphism, fixed-point-free automorphism, polycirculant conjecture
Published in RUP: 03.01.2022; Views: 763; Downloads: 17
.pdf Full text (235,26 KB)

3.
The automorphism groups of non-edge transitive rose window graphs
Edward Dobson, István Kovács, Štefko Miklavič, 2015, original scientific article

Abstract: In this paper, we determine the full automorphism groups of rose window graphs that are not edge-transitive. As the full automorphism groups of edge-transitive rose window graphs have been determined, this complete the problem of calculating the full automorphism group of rose window graphs. As a corollary, we determine which rose window graphs are vertex-transitive. Finally, we determine the isomorphism classes of non-edge-transitive rose window graphs.
Keywords: rose window graphs, automorphism group, isomorphism problem, vertex-transitive graph
Published in RUP: 31.12.2021; Views: 865; Downloads: 18
.pdf Full text (275,74 KB)

4.
5.
6.
A family of non-Cayley cores that are constructed from vertex-transitive or strongly regular self-complementary graphs
Marko Orel, 2021, published scientific conference contribution abstract

Keywords: cores, graph homomorphisms, automorphism group, self-complementary graphs
Published in RUP: 30.07.2021; Views: 963; Downloads: 73
URL Link to full text
This document has more files! More...

7.
A family of non-Cayley cores that are constructed from vertex-transitive or strongly regular self-complementary graphs
Marko Orel, 2021, published scientific conference contribution abstract

Keywords: cores, graph homomorphisms, automorphism group, self-complementary graphs
Published in RUP: 30.07.2021; Views: 1166; Downloads: 42
.pdf Full text (1,01 MB)
This document has more files! More...

8.
Hamilton cycles in primitive vertex-transitive graphs of order a product of two primes - the case PSL(2, q[sup]2) acting on cosets of PGL(2, q)
Shao Fei Du, Klavdija Kutnar, Dragan Marušič, 2020, original scientific article

Abstract: A step forward is made in a long standing Lovász problem regarding hamiltonicity of vertex-transitive graphs by showing that every connected vertex-transitive graph of order a product of two primes arising from the group action of the projective special linear group PSL▫$(2, q^2)$▫ on cosets of its subgroup isomorphic to the projective general linear group PGL$(2, q)$ contains a Hamilton cycle.
Keywords: vertex-transitive graph, Hamilton cycle, automorphism group, orbital graph
Published in RUP: 20.07.2020; Views: 1247; Downloads: 46
.pdf Full text (365,31 KB)

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