Paired many-to-many disjoint path covers of hypertori

DOI10.1016/J.DAM.2016.09.020MaRDI QIDQ730480zbMATH OpenOpenAlexFDO

Authors Brian G. Kronenthal, Tony W. H. Wong

Publication date 28 December 2016

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2016.09.020

zbMATH Keywords

disjoint path coversFlow Freehypertorustorus

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
• Torus-like graphs and their paired many-to-many disjoint path covers
• Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
• Paired many-to-many disjoint path covers of the hypercubes
• One-to-one disjoint path covers on multi-dimensional tori

Cites work

• A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs
• A survey of the theory of hypercube graphs
• Hamilton connected graphs
• Hamiltonian-connected graphs
• Lee distance and topological properties of k-ary n-cubes
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• One-to-one disjoint path covers on k-ary n-cubes
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• Paired many-to-many disjoint path covers in faulty hypercubes
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Path partitions of hypercubes
• Strongly Hamiltonian laceability of the even \(k\)-ary \(n\)-cube

Cited in

(7)

• Torus-like graphs and their paired many-to-many disjoint path covers
• Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults
• The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
• 2-edge-Hamilton-connectedness of complete hypercube-like networks
• Paired (n - 1)-to-(n - 1) disjoint path covers in bipartite transposition-like graphs
• Many-to-many two-disjoint path covers in Cayley graphs generated by unicyclic graphs
• Paired 2-disjoint path covers of multidimensional torus networks with faulty edges

This page was built for publication: Paired many-to-many disjoint path covers of hypertori

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730480)