A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The Panpositionable Pancyclicity of Locally Twisted Cubes

2018
*
IEICE transactions on information and systems
*

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 ≤ m ≤ |V(G)| 2 , G has a cycle C containing u and

doi:10.1587/transinf.2018pap0006
fatcat:tjlp252fozerff2cwmt6nmag6y