Disjoint path covers with path length constraints in restricted hypercube-like graphs
作者：
Highlights：
• A disjoint path cover is a set of pairwise disjoint paths that altogether cover every vertex.
• A disjoint path cover with prescribed sources and path lengths is considered.
• Restricted hypercube-like graphs are a subfamily of nonbipartite hypercube-like graphs.
• Constructions of disjoint path covers in restricted hypercube-like graphs are presented.
• The constructions are optimal.
摘要
•A disjoint path cover is a set of pairwise disjoint paths that altogether cover every vertex.•A disjoint path cover with prescribed sources and path lengths is considered.•Restricted hypercube-like graphs are a subfamily of nonbipartite hypercube-like graphs.•Constructions of disjoint path covers in restricted hypercube-like graphs are presented.•The constructions are optimal.
论文关键词：Hypercube-like graph,Disjoint path cover,Path partition,Prescribed sources,Prescribed path lengths,Fault tolerance,Interconnection network
论文评审过程：Received 12 January 2016, Revised 18 August 2016, Accepted 21 May 2017, Available online 30 May 2017, Version of Record 7 August 2017.
论文官网地址：https://doi.org/10.1016/j.jcss.2017.05.007
