Vertex-disjoint paths joining adjacent vertices in faulty hypercubes

DOI10.1016/j.tcs.2019.06.015zbMath1434.68351OpenAlexW2953495953WikidataQ127566418 ScholiaQ127566418MaRDI QIDQ2330114

Dongqin Cheng

Publication date: 18 October 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.06.015

zbMATH Keywords

hypercubefault-toleranceinterconnection networkpath embeddingvertex-disjoint

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Unnamed Item
• Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
• Paired many-to-many disjoint path covers in faulty hypercubes
• One-to-many node-disjoint paths of hyper-star networks
• Embedding even cycles on folded hypercubes with conditional faulty edges
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
• Many-to-many disjoint paths in faulty hypercubes
• Cycles embedding in hypercubes with node failures
• Path embedding in faulty hypercubes
• Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Paired many-to-many disjoint path covers of the hypercubes
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes

This page was built for publication: Vertex-disjoint paths joining adjacent vertices in faulty hypercubes