IEICE TRANSACTIONS on Fundamentals
Cayley Graph Representation and Graph Product Representation of Hypercubes
Summary :
Hypercube Qn is a well-known graph structure having three different kinds of equivalent definitions that are: 1. binary n bit sequences with the adjacency condition, 2. Q1=K2, Qn=Qn-1
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E94-A No.3 pp.946-954
- Publication Date
- 2011/03/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E94.A.946
- Type of Manuscript
- PAPER
- Category
- Graphs and Networks
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Miya MOROTA, Ryoichi HATAYAMA, Yukio SHIBATA, "Cayley Graph Representation and Graph Product Representation of Hypercubes" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 3, pp. 946-954, March 2011, doi: 10.1587/transfun.E94.A.946.
Abstract: Hypercube Qn is a well-known graph structure having three different kinds of equivalent definitions that are: 1. binary n bit sequences with the adjacency condition, 2. Q1=K2, Qn=Qn-1
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.946/_p
Copy
@ARTICLE{e94-a_3_946,
author={Miya MOROTA, Ryoichi HATAYAMA, Yukio SHIBATA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Cayley Graph Representation and Graph Product Representation of Hypercubes},
year={2011},
volume={E94-A},
number={3},
pages={946-954},
abstract={Hypercube Qn is a well-known graph structure having three different kinds of equivalent definitions that are: 1. binary n bit sequences with the adjacency condition, 2. Q1=K2, Qn=Qn-1
keywords={},
doi={10.1587/transfun.E94.A.946},
ISSN={1745-1337},
month={March},}
Copy
TY - JOUR
TI - Cayley Graph Representation and Graph Product Representation of Hypercubes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 946
EP - 954
AU - Miya MOROTA
AU - Ryoichi HATAYAMA
AU - Yukio SHIBATA
PY - 2011
DO - 10.1587/transfun.E94.A.946
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2011
AB - Hypercube Qn is a well-known graph structure having three different kinds of equivalent definitions that are: 1. binary n bit sequences with the adjacency condition, 2. Q1=K2, Qn=Qn-1
ER -
English
