Vertex-disjoint paths in a 3-ary \(n\)-cube with faulty vertices

DOI10.1155/2020/3953161zbMath1459.05137OpenAlexW3047388809MaRDI QIDQ2196925

Xiaolei Ma, Shi-ying Wang

Publication date: 4 September 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/3953161

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Distributed systems (68M14)

Cites Work

• Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
• One-to-many node-disjoint paths of hyper-star networks
• One-to-one disjoint path covers on alternating group graphs
• Many-to-many disjoint paths in hypercubes with faulty vertices
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• One-to-many node-disjoint paths in \((n,k)\)-star graphs

This page was built for publication: Vertex-disjoint paths in a 3-ary \(n\)-cube with faulty vertices