The search functionality is under construction.

The search functionality is under construction.

In a multiprocessor system, processors are connected based on various types of network topologies. A network topology is usually represented by a graph. Let *G* be a graph and *u*, *v* be any two distinct vertices of *G*. We say that *G* is pancyclic if *G* has a cycle *C* of every length *l*(*C*) satisfying 3≤*l*(*C*)≤|*V*(*G*)|, where |*V*(*G*)| denotes the total number of vertices in *G*. Moreover, *G* is panpositionably pancyclic from *r* if for any integer *m* satisfying $r leq m leq rac{|V(G)|}{2}$, *G* has a cycle *C* containing *u* and *v* such that *d _{C}*(

- Publication
- IEICE TRANSACTIONS on Information Vol.E101-D No.12 pp.2902-2907

- Publication Date
- 2018/12/01

- Publicized
- 2018/09/18

- Online ISSN
- 1745-1361

- DOI
- 10.1587/transinf.2018PAP0006

- Type of Manuscript
- Special Section PAPER (Special Section on Parallel and Distributed Computing and Networking)

- Category
- Graph Algorithms

Hon-Chan CHEN

National Chin-Yi University of Technology

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.

Copy

Hon-Chan CHEN, "The Panpositionable Pancyclicity of Locally Twisted Cubes" in IEICE TRANSACTIONS on Information,
vol. E101-D, no. 12, pp. 2902-2907, December 2018, doi: 10.1587/transinf.2018PAP0006.

Abstract: In a multiprocessor system, processors are connected based on various types of network topologies. A network topology is usually represented by a graph. Let *G* be a graph and *u*, *v* be any two distinct vertices of *G*. We say that *G* is pancyclic if *G* has a cycle *C* of every length *l*(*C*) satisfying 3≤*l*(*C*)≤|*V*(*G*)|, where |*V*(*G*)| denotes the total number of vertices in *G*. Moreover, *G* is panpositionably pancyclic from *r* if for any integer *m* satisfying $r leq m leq rac{|V(G)|}{2}$, *G* has a cycle *C* containing *u* and *v* such that *d _{C}*(

URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2018PAP0006/_p

Copy

@ARTICLE{e101-d_12_2902,

author={Hon-Chan CHEN, },

journal={IEICE TRANSACTIONS on Information},

title={The Panpositionable Pancyclicity of Locally Twisted Cubes},

year={2018},

volume={E101-D},

number={12},

pages={2902-2907},

abstract={In a multiprocessor system, processors are connected based on various types of network topologies. A network topology is usually represented by a graph. Let *G* be a graph and *u*, *v* be any two distinct vertices of *G*. We say that *G* is pancyclic if *G* has a cycle *C* of every length *l*(*C*) satisfying 3≤*l*(*C*)≤|*V*(*G*)|, where |*V*(*G*)| denotes the total number of vertices in *G*. Moreover, *G* is panpositionably pancyclic from *r* if for any integer *m* satisfying $r leq m leq rac{|V(G)|}{2}$, *G* has a cycle *C* containing *u* and *v* such that *d _{C}*(

keywords={},

doi={10.1587/transinf.2018PAP0006},

ISSN={1745-1361},

month={December},}

Copy

TY - JOUR

TI - The Panpositionable Pancyclicity of Locally Twisted Cubes

T2 - IEICE TRANSACTIONS on Information

SP - 2902

EP - 2907

AU - Hon-Chan CHEN

PY - 2018

DO - 10.1587/transinf.2018PAP0006

JO - IEICE TRANSACTIONS on Information

SN - 1745-1361

VL - E101-D

IS - 12

JA - IEICE TRANSACTIONS on Information

Y1 - December 2018

AB - In a multiprocessor system, processors are connected based on various types of network topologies. A network topology is usually represented by a graph. Let *G* be a graph and *u*, *v* be any two distinct vertices of *G*. We say that *G* is pancyclic if *G* has a cycle *C* of every length *l*(*C*) satisfying 3≤*l*(*C*)≤|*V*(*G*)|, where |*V*(*G*)| denotes the total number of vertices in *G*. Moreover, *G* is panpositionably pancyclic from *r* if for any integer *m* satisfying $r leq m leq rac{|V(G)|}{2}$, *G* has a cycle *C* containing *u* and *v* such that *d _{C}*(

ER -