Presentation 2004-09-17
A group action graph representation of the Kautz digraph
Yuuki TANAKA, Yukio SHIBATA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) De Bruijn digraphs and shuffle-exchange graphs are known to be useful models for interconnection net-works. They can be represented as Cayley coset graphs of the wrapped butterfly graph and the cube-connected cycles, respectively. The Kautz digraphs have the similar definitions and properties to de Bruijn digraphs. It is d-regular and strongly d-connected, thus it is a GAG and a coset digraph. In this paper, we will show a new representation of the Kautz digraph and settle the open problem posed by M.-C. Heydemann in [5].
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Cayley digraph / Kautz digraph / wreath product of groups / group action graph
Paper # COMP2004-32
Date of Issue

Conference Information
Committee COMP
Conference Date 2004/9/10(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A group action graph representation of the Kautz digraph
Sub Title (in English)
Keyword(1) Cayley digraph
Keyword(2) Kautz digraph
Keyword(3) wreath product of groups
Keyword(4) group action graph
1st Author's Name Yuuki TANAKA
1st Author's Affiliation Department of Computer Science, Gunma University()
2nd Author's Name Yukio SHIBATA
2nd Author's Affiliation Department of Computer Science, Gunma University
Date 2004-09-17
Paper # COMP2004-32
Volume (vol) vol.104
Number (no) 317
Page pp.pp.-
#Pages 7
Date of Issue