IEICE TRANSACTIONS on Information
Cycle Embedding in Generalized Recursive Circulant Graphs
Summary :
Generalized recursive circulant graphs (GRCGs for short) are a generalization of recursive circulant graphs and provide a new type of topology for interconnection networks. A graph of n vertices is said to be s-pancyclic for some $3leqslant sleqslant n$ if it contains cycles of every length t for $sleqslant tleqslant n$. The pancyclicity of recursive circulant graphs was investigated by Araki and Shibata (Inf. Process. Lett. vol.81, no.4, pp.187-190, 2002). In this paper, we are concerned with the s-pancyclicity of GRCGs.
- Publication
- IEICE TRANSACTIONS on Information Vol.E101-D No.12 pp.2916-2921
- Publication Date
- 2018/12/01
- Publicized
- 2018/09/18
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2018PAP0009
- Type of Manuscript
- Special Section PAPER (Special Section on Parallel and Distributed Computing and Networking)
- Category
- Graph Algorithms
Authors
Shyue-Ming TANG
National Defense University
Yue-Li WANG
National Taiwan University of Science and Technology
Chien-Yi LI
National Taiwan University of Science and Technology
Jou-Ming CHANG
National Taipei University of Business
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
Shyue-Ming TANG, Yue-Li WANG, Chien-Yi LI, Jou-Ming CHANG, "Cycle Embedding in Generalized Recursive Circulant Graphs" in IEICE TRANSACTIONS on Information,
vol. E101-D, no. 12, pp. 2916-2921, December 2018, doi: 10.1587/transinf.2018PAP0009.
Abstract: Generalized recursive circulant graphs (GRCGs for short) are a generalization of recursive circulant graphs and provide a new type of topology for interconnection networks. A graph of n vertices is said to be s-pancyclic for some $3leqslant sleqslant n$ if it contains cycles of every length t for $sleqslant tleqslant n$. The pancyclicity of recursive circulant graphs was investigated by Araki and Shibata (Inf. Process. Lett. vol.81, no.4, pp.187-190, 2002). In this paper, we are concerned with the s-pancyclicity of GRCGs.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2018PAP0009/_p
Copy
@ARTICLE{e101-d_12_2916,
author={Shyue-Ming TANG, Yue-Li WANG, Chien-Yi LI, Jou-Ming CHANG, },
journal={IEICE TRANSACTIONS on Information},
title={Cycle Embedding in Generalized Recursive Circulant Graphs},
year={2018},
volume={E101-D},
number={12},
pages={2916-2921},
abstract={Generalized recursive circulant graphs (GRCGs for short) are a generalization of recursive circulant graphs and provide a new type of topology for interconnection networks. A graph of n vertices is said to be s-pancyclic for some $3leqslant sleqslant n$ if it contains cycles of every length t for $sleqslant tleqslant n$. The pancyclicity of recursive circulant graphs was investigated by Araki and Shibata (Inf. Process. Lett. vol.81, no.4, pp.187-190, 2002). In this paper, we are concerned with the s-pancyclicity of GRCGs.},
keywords={},
doi={10.1587/transinf.2018PAP0009},
ISSN={1745-1361},
month={December},}
Copy
TY - JOUR
TI - Cycle Embedding in Generalized Recursive Circulant Graphs
T2 - IEICE TRANSACTIONS on Information
SP - 2916
EP - 2921
AU - Shyue-Ming TANG
AU - Yue-Li WANG
AU - Chien-Yi LI
AU - Jou-Ming CHANG
PY - 2018
DO - 10.1587/transinf.2018PAP0009
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E101-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2018
AB - Generalized recursive circulant graphs (GRCGs for short) are a generalization of recursive circulant graphs and provide a new type of topology for interconnection networks. A graph of n vertices is said to be s-pancyclic for some $3leqslant sleqslant n$ if it contains cycles of every length t for $sleqslant tleqslant n$. The pancyclicity of recursive circulant graphs was investigated by Araki and Shibata (Inf. Process. Lett. vol.81, no.4, pp.187-190, 2002). In this paper, we are concerned with the s-pancyclicity of GRCGs.
ER -
English
