Three Types of Two-Disjoint-Cycle-Cover Pancyclicity and Their Applications to Cycle Embedding in Locally Twisted Cubes
Authors:
- 18 November 2019
- journal article
- research article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 64 (1) , 27-37
Abstract
A graph $G=(V,E)$ is two-disjoint-cycle-cover $[r_1,r_2]$-pancyclic if for any integer $l$ satisfying $r_1 \leq l \leq r_2$, there exist two vertex-disjoint cycles $C_1$ and $C_2$ in $G$ such that the lengths of $C_1$ and $C_2$ are $l$ and $|V(G)| - l$, respectively, where $|V(G)|$ denotes the total number of vertices in $G$. On the basis of this definition, we further propose Ore-type conditions for graphs to be two-disjoint-cycle-cover vertex/edge $[r_1,r_2]$-pancyclic. In addition, we study cycle embedding in the $n$-dimensional locally twisted cube $LTQ_n$ under the consideration of two-disjoint-cycle-cover vertex/edge pancyclicity.
Keywords
Funding Information
- Ministry of Science and Technology (MOST 106-2221-E-468-003)
This publication has 31 references indexed in Scilit:
- Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubesTheoretical Computer Science, 2011
- Embedding meshes into locally twisted cubesInformation Sciences, 2010
- Graph Theory and Interconnection Networks2008
- Panconnectivity of locally twisted cubesApplied Mathematics Letters, 2006
- The locally twisted cubesInternational Journal of Computer Mathematics, 2005
- Augmented cubesNetworks, 2002
- Topological Structure and Analysis of Interconnection Networks2001
- The twisted cube topology for multiprocessors: A study in network asymmetryJournal of Parallel and Distributed Computing, 1991
- A variation on the hypercube with lower diameterIEEE Transactions on Computers, 1991
- Topological properties of hypercubesIEEE Transactions on Computers, 1988