Two spanning disjoint paths with required length in generalized hypercubes

DOI10.1016/J.TCS.2013.08.004zbMATH Open1302.05091OpenAlexW1986597541MaRDI QIDQ393111FDOQ393111

Authors: Dyi-Rong Duh, Yao-Chung Lin, Cheng-Nan Lai, Yue-Li Wang 

Publication date: 16 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.08.004

Recommendations

• An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes
• scientific article; zbMATH DE number 219253
• The 2-path-bipanconnectivity of hypercubes
• Disjoint paths in hypercubes with prescribed origins and lengths
• scientific article; zbMATH DE number 1161303

zbMATH Keywords

path embedding2RP-propertygeneralized hypercubeHamiltonian-connectedvertex-disjoint paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Hypergraphs (05C65) Structural characterization of families of graphs (05C75)

Cites Work

• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Panconnectivity of locally twisted cubes
• Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• Combinatorial properties of generalized hypercube graphs
• Hamiltonicity of hypercubes with a constraint of required and faulty edges
• Complete path embeddings in crossed cubes
• Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
• Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
• On the spanning connectivity and spanning laceability of hypercube-like networks

Cited In (4)

• An efficient algorithm to construct disjoint path covers of DCell networks
• Disjoint paths in hypercubes with prescribed origins and lengths
• Extremal Results on Vertex and Link Residual Closeness
• Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges

This page was built for publication: Two spanning disjoint paths with required length in generalized hypercubes

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