One-to-one disjoint-path covers of leaf-sort graphs

DOI10.1142/s0129626424500105MaRDI QIDQ6656781

Shi-ying Wang, Li-Na Zhao, Wei Feng, Huanhuan Wang

Publication date: 3 January 2025

Published in: Parallel Processing Letters (Search for Journal in Brave)

zbMATH Keywords

interconnection networkdisjoint path coverHamiltonian laceableleaf-sort graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
• One-to-one disjoint path covers in digraphs
• The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
• Disjoint path covers joining prescribed source and sink sets in interval graphs
• Connectivity and Diagnosability of Leaf-Sort Graphs
• One-to-one disjoint path covers on multi-dimensional tori
• The disjoint path cover in the data center network HSDC with prescribed vertices in each path
• Paired 2-disjoint path covers of burnt pancake graphs with faulty elements

This page was built for publication: One-to-one disjoint-path covers of leaf-sort graphs