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 - 5 / 5
First pagePrevious page1Next pageLast page
1.
Isomorphism testing of k-spanning tournaments is fixed parameter tractable
Vikraman Arvind, Ilia Ponomarenko, Grigory Ryabov, 2025, original scientific article

Abstract: An arc-colored tournament is said to be k-spanning for an integer k ≥ 1 if the union of its arc-color classes of maximal valency at most k is the arc set of a strongly connected digraph. It is proved that isomorphism testing of k-spanning tournaments is fixed-parameter tractable.
Keywords: graph isomorphism problem, colored tournaments, fixed-parameter tractable algorithm
Published in RUP: 03.11.2025; Views: 305; Downloads: 2
.pdf Full text (379,74 KB)

2.
The automorphism groups of non-edge transitive rose window graphs
Edward Tauscher 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: 2737; Downloads: 45
.pdf Full text (275,74 KB)

3.
4.
5.
Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica