Presentation	2006-09-26 Vertex-transitivity of graphs of hypercube family Ryoichi HATAYAMA, Yukio SHIBATA,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	Uniformity of graphs structure may be requested when evaluating graphs as interconnection networks. It becomes the guarantee of the uniformity in graph structure to prove that graphs are vertex-transitive. A graph G is vertex-transitive if there exists an automorphism φ such that φ(u)=v for any pair u,v of vertices of G. It is well known that hypercubes are vertex-transitive, and many variations of hypercubes are proposed. In this study, we prove that crossed cubes, Mobius cubes and shuffle cubes which are variations of hypercubes are not vertex-transitive.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	hypercube family / vertex-transitive
Paper #	COMP2006-26
Date of Issue

Conference Information
Committee	COMP
Conference Date	2006/9/19(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)	Vertex-transitivity of graphs of hypercube family
Sub Title (in English)
Keyword(1)	hypercube family
Keyword(2)	vertex-transitive
1st Author's Name	Ryoichi HATAYAMA
1st Author's Affiliation	Department of Computer Science, Faculty of Engineering, Gunma University()
2nd Author's Name	Yukio SHIBATA
2nd Author's Affiliation	Department of Computer Science, Faculty of Engineering, Gunma University
Date	2006-09-26
Paper #	COMP2006-26
Volume (vol)	vol.106
Number (no)	258
Page	pp.pp.-
#Pages	6
Date of Issue