Univerza na Primorskem
Fakulteta za matematiko, naravoslovje in informacijske tehnologije
12.03.2012 Lecturer: dr. Istvan Kovacs
Title: The isomorphism problem for rose window graphs
Abstract: For an integer n ≥ 3, and a, r ∈ {1, 2, …, n − 1} with r ≠ n/2, the rose window graph Rn (a, r) is the graph Γ, where V (Γ) = {Ai , Bi | i ∈ {0, 1, …, n − 1}}, and E(Γ) consists of four types of edges as for every i ∈ {0, 1, …, n − 1}: {Ai , Ai+1 }, {Ai , Bi }, {Ai+a , Bi } and {Bi , Bi+r},
where addition is taken modulo n. In this talk we consider the following problem:
given a rose window graph Rn (a, r), find all pairs (b, s) ∈ {1, 2, …, n−1}2 for which
Rn (b, s) is isomorphic to Rn (a, r). We present a solution using a permutation
group theoretical approach.
This is a joint work with E. Dobson and Š. Miklavič.
