Results 121 to 130 of about 1,777 (160)

New sufficient conditions for Hamiltonian, pancyclic and edge-Hamilton graphs

Fayun Cao, Han Ren
openalex   +1 more source

Pancyclicity when each cycle must pass exactly $k$ Hamilton cycle chords

, 2012
Fatima Affif Chaouche, Carrie Rutherford, Robin Whitty   +2 more
openalex   +2 more sources

Rainbow Pancyclicity in Graph Systems

, 2019
Yangyang Cheng, Guanghui Wang, Yi Zhao
openalex   +2 more sources

Node-pancyclicity and edge-pancyclicity of hypercube variants [PDF]

Information Processing Letters, 2007
Abstract Twisted cubes, crossed cubes, Mobius cubes, and locally twisted cubes are some of the widely studied hypercube variants. The 4-pancyclicity of twisted cubes, crossed cubes, Mobius cubes, locally twisted cubes and the 4-edge-pancyclicity of twisted cubes, crossed cubes, Mobius cubes are proven in [C.P. Chang, J.N. Wang, L.H.
Chiuyuan Chen, Lih-Hsing Hsu, Ken S. Hu, Shyun-Shyun Yeoh   +3 more
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

(n - 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn

International Journal of Foundations of Computer Science, 2021
As one of the most fundamental networks for parallel and distributed computation, cycle is suitable for developing simple algorithms with low communication cost.
Xirong Xu, Huifeng Zhang, Ziming Wang, Qiang Zhang, P. Zhang   +4 more
semanticscholar   +1 more source

s-Vertex Pancyclic Index [PDF]

Graphs and Combinatorics, 2011
A graph G is vertex pancyclic if for each vertex $${v \in V(G)}$$, and for each integer k with 3 ≤ k ≤ |V(G)|, G has a k-cycle C k such that $${v \in V(C_k)}$$. Let s ≥ 0 be an integer. If the removal of at most s vertices in G results in a vertex pancyclic graph, we say G is an s-vertex pancyclic graph.
Guihai Chen, Zhang Li-Li, Xinping Xu, Yehong Shao, Ju Zhou   +4 more
openaire   +1 more source

\((n−2)\)-Fault-Tolerant Edge-Pancyclicity of Möbius Cubes \(MQ_n\)

Ars combinatoria
The \( n \)-dimensional Möbius cube \( MQ_n \) is an important variant of the hypercube \( Q_n \), which possesses some properties superior to the hypercube. This paper investigates the fault-tolerant edge-pancyclicity of \( MQ_n \), and shows that if \(
Huifeng Zhang, Jun Zhu, Xirong Xu, Peng Zhang   +3 more
semanticscholar   +1 more source

Node-pancyclicity and edge-pancyclicity of crossed cubes

Information Processing Letters, 2005
Crossed cubes are important variants of the hypercubes. It has been proven that crossed cubes have attractive properties in Hamiltonian connectivity and pancyclicity. In this paper, we study two stronger features of crossed cubes. We prove that the n-dimensional crossed cube is not only node-pancyclic but also edge-pancyclic for n ≥ 2.
Xiaola Lin, Jianxi Fan, Xiaohua Jia
openaire   +2 more sources

On vertex-pancyclicity and edge-pancyclicity of the WK-Recursive network

Information Sciences, 2014
Abstract In this paper, we study the pancyclic properties of the WK-Recursive networks. We show that a WK-Recursive network with amplitude W and level L is vertex-pancyclic for W  ⩾ 6. That is, each vertex on them resides in cycles of all lengths ranging from 3 to N , where N is the size of the interconnection network.
Chien-Hung Huang, Jywe-Fei Fang
openaire   +2 more sources