ENG

Iskanje po repozitoriju

A- | A+ | Natisni

Iskalni niz:	išči po
	išči po
	išči po
	išči po
Vrsta gradiva:	* po starem in bolonjskem študiju
Jezik:
Išči po:
Opcije:	Prikaži samo zadetke s celotnim besedilom
	Ponastavi

1 - 5 / 5

Isomorphism testing of k-spanning tournaments is fixed parameter tractable
Vikraman Arvind, Ilia Ponomarenko, Grigory Ryabov, 2025, izvirni znanstveni članek

Opis: 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.
Ključne besede: graph isomorphism problem, colored tournaments, fixed-parameter tractable algorithm
Objavljeno v RUP: 03.11.2025; Ogledov: 221; Prenosov: 1
Celotno besedilo (379,74 KB)

The automorphism groups of non-edge transitive rose window graphs
Edward Tauscher Dobson, István Kovács, Štefko Miklavič, 2015, izvirni znanstveni članek

Opis: 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.
Ključne besede: rose window graphs, automorphism group, isomorphism problem, vertex-transitive graph
Objavljeno v RUP: 31.12.2021; Ogledov: 2574; Prenosov: 43
Celotno besedilo (275,74 KB)

The simultaneous conjugacy problem in the symmetric group
Andrej Brodnik, Aleksander Malnič, Rok Požar, 2021, izvirni znanstveni članek

Ključne besede: divide-and-conquer, fast multiplication algorithm, graph isomorphism, permutation multiplication, simultaneous conjugacy problem
Objavljeno v RUP: 06.05.2021; Ogledov: 2443; Prenosov: 16
Povezava na celotno besedilo

On the isomorphism problem for Cayley graphs of abelian groups whose Sylow subgroups are elementary abelian or cyclic
Edward Tauscher Dobson, 2018, izvirni znanstveni članek

Ključne besede: Cayley isomorphism problem, Cayley graph, CI-group
Objavljeno v RUP: 18.07.2018; Ogledov: 3130; Prenosov: 93
Povezava na celotno besedilo

Further restrictions on the structure of finite DCI-groups : an addendum
Edward Tauscher Dobson, Joy Morris, Pablo Spiga, 2015, izvirni znanstveni članek

Ključne besede: isomorphism problem, CI-group, dihedral group, Cayley graph
Objavljeno v RUP: 08.08.2016; Ogledov: 4228; Prenosov: 67
Povezava na celotno besedilo

Iskanje izvedeno v 0.01 sek.

Na vrh