Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs

DOI10.1016/J.INS.2013.04.013MaRDI QIDQ497240zbMATH OpenOpenAlexFDO

Authors Shinhaeng Jo, Jung-Heum Park, Kyung-Yong Chwa

Publication date 23 September 2015

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2013.04.013

zbMATH Keywords

bipartite HL-graphdisjoint pathfault toleranceHamiltonian pathstrongly Hamiltonian-laceable

Mathematics Subject Classification ID

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

Recommendations

• Paired many-to-many disjoint path covers in faulty hypercubes
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• Paired many-to-many disjoint path covers in restricted hypercube-like graphs
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
• Paired 2-disjoint path covers of multidimensional torus networks with faulty edges

Cites work

• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• Graph theory
• Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
• Hamiltonian paths with prescribed edges in hypercubes
• Hamiltonian properties on the class of hypercube-like networks
• scientific article; zbMATH DE number 53191 (Why is no real title available?)
• Long paths and cycles in hypercubes with faulty vertices
• Long paths in hypercubes with conditional node-faults
• Longest fault-free paths in hypercubes with vertex faults
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Many-to-many disjoint paths in faulty hypercubes
• On Path Cover Problems in Digraphs and Applications to Program Testing
• On shortest disjoint paths in planar graphs
• On the spanning connectivity and spanning laceability of hypercube-like networks
• Paired Many-to-Many Disjoint Path Covers in Recursive Circulants (G(2ᵐ,4))
• Paired many-to-many disjoint path covers of the hypercubes
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Path partitions of hypercubes
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
• The bicube: an interconnection of two hypercubes
• The two-equal-disjoint path cover problem of matching composition network
• Two conditions for reducing the maximal length of node-disjoint paths in hypercubes

Cited in

(20)

• The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Disjoint path covers with path length constraints in restricted hypercube-like graphs
• Many-to-many two-disjoint path covers in restricted hypercube-like graphs
• Algorithms for finding disjoint path covers in unit interval graphs
• Paired many-to-many disjoint path covers in restricted hypercube-like graphs
• Paired many-to-many disjoint path covers in faulty hypercubes
• The bicube: an interconnection of two hypercubes
• Odd cycles embedding on folded hypercubes with conditional faulty edges
• A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs
• One-to-one disjoint-path covers of leaf-sort graphs
• Degree conditions for disjoint path covers in graphs
• Paired (n - 1)-to-(n - 1) disjoint path covers in bipartite transposition-like graphs
• On the unit interval graphs which are paired k-disjoint path coverable
• Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes
• Paired many-to-many disjoint path covers of hypertori
• Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
• Paired 2-disjoint path covers of faulty \(k\)-ary \(n\)-cubes
• Ore-type degree conditions for disjoint path covers in simple graphs
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs

This page was built for publication: Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs

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