4.3 Article

Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Theory & Methods

Fault-tolerant Hamiltonian connectivity of 2-tree-generated networks

Mohamad Abdallah et al.

Summary: This paper focuses on a class of Cayley graphs generated by certain 3-cycles on the alternating group An as models for interconnection networks. The fault-Hamiltonian connectivity of these graphs is analyzed, and it is proven that these graphs are (2n - 7)-fault-tolerant Hamiltonian connected.

THEORETICAL COMPUTER SCIENCE (2022)

Article Computer Science, Theory & Methods

Hamiltonian Paths of k-ary n-cubes Avoiding Faulty Links and Passing Through Prescribed Linear Forests

Yuxing Yang et al.

Summary: The paper investigates the conditions for the existence of a Hamiltonian path in faulty k-ary n-cube networks. It is proven that a Hamiltonian path exists through a linear forest in the network when the paths in the linear forest do not have the target nodes as internal or end nodes.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2022)

Article Computer Science, Theory & Methods

Hybrid fault-tolerant prescribed hyper-hamiltonian laceability of hypercubes

Yuxing Yang et al.

Summary: This paper investigates properties of n-dimensional hypercubes and proves the existence of Hamiltonian paths or cycles in specific conditions for Q(n)-F-v-F-e and its subgraphs.

THEORETICAL COMPUTER SCIENCE (2021)

Article Mathematics, Applied

Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes

Dongqin Cheng

DISCRETE APPLIED MATHEMATICS (2019)

Article Computer Science, Theory & Methods

Hamiltonian paths passing through prescribed edges in balanced hypercubes

Huazhong Lu et al.

THEORETICAL COMPUTER SCIENCE (2019)

Article Computer Science, Theory & Methods

Embedding fault-free hamiltonian paths with prescribed linear forests into faulty ternary n-cubes

Yuxing Yang et al.

THEORETICAL COMPUTER SCIENCE (2019)

Article Computer Science, Information Systems

Fault-tolerant-prescribed hamiltonian laceability of balanced hypercubes

Yuxing Yang et al.

INFORMATION PROCESSING LETTERS (2019)

Article Computer Science, Theory & Methods

Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults

Pingshan Li et al.

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE (2019)

Article Computer Science, Hardware & Architecture

Symmetric Property and Reliability of Balanced Hypercube

Jin-Xin Zhou et al.

IEEE TRANSACTIONS ON COMPUTERS (2015)

Article Computer Science, Information Systems

Fault-tolerant Hamiltonian laceability of balanced hypercubes

Qingguo Zhou et al.

INFORMATION SCIENCES (2015)

Article Computer Science, Information Systems

Various cycles embedding in faulty balanced hypercubes

Dongqin Cheng et al.

INFORMATION SCIENCES (2015)

Article Computer Science, Information Systems

Vertex-fault-tolerant cycles embedding in balanced hypercubes

Dongqin Cheng et al.

INFORMATION SCIENCES (2014)

Article Computer Science, Hardware & Architecture

Hyper-Hamiltonian laceability of balanced hypercubes

Huazhong Lu et al.

JOURNAL OF SUPERCOMPUTING (2014)

Article Computer Science, Theory & Methods

Matching preclusion for balanced hypercubes

Huazhong Lu et al.

THEORETICAL COMPUTER SCIENCE (2012)

Article Computer Science, Theory & Methods

Bipanconnectivity and Bipancyclicity in k-ary n-cubes

Iain A. Stewart et al.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2009)

Article Computer Science, Information Systems

Hamiltonian paths and cycles passing through a prescribed path in hypercubes

Xie-Bin Chen

INFORMATION PROCESSING LETTERS (2009)

Article Computer Science, Theory & Methods

Embedding long paths in k-ary n-cubes with faulty nodes and links

Iain A. Stewart et al.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2008)

Article Computer Science, Information Systems

A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges

Wen-Qing Wang et al.

INFORMATION PROCESSING LETTERS (2008)

Article Computer Science, Theory & Methods

Fault-tolerant embedding of paths in crossed cubes

Meijie Ma et al.

THEORETICAL COMPUTER SCIENCE (2008)

Article Computer Science, Information Systems

Cycles passing through prescribed edges in a hypercube with some faulty edges

Xie-Bin Chen

INFORMATION PROCESSING LETTERS (2007)

Article Mathematics

Hamiltonian paths with prescribed edges in hypercubes

Tomas Dvorak et al.

DISCRETE MATHEMATICS (2007)

Article Mathematics, Applied

Hamiltonian cycles with prescribed edges in hypercubes

T Dvorak

SIAM JOURNAL ON DISCRETE MATHEMATICS (2005)

Article Computer Science, Hardware & Architecture

Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes

MM Bae et al.

IEEE TRANSACTIONS ON COMPUTERS (2003)