On the spanning connectivity and spanning laceability of hypercube-like networks

DOI10.1016/J.TCS.2007.05.002MaRDI QIDQ995576zbMATHOpenAlexFDO

Authors Cheng-Kuan Lin, Jimmy J. M. Tan, D. Frank Hsu, Lih-Hsing Hsu

Publication date 3 September 2007

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

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

zbMATH Keywords

Hamiltonianhypercube-like networksspanning connectivityHamiltonian laceableHamiltonian connectedhypercube networksspanning laceability\(w^*\)-connected\(w^*\)-laceablegraph container

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40)

Recommendations

• The spanning laceability on the faulty bipartite hypercube-like networks
• Fault tolerance of hypercube like networks: spanning laceability under edge faults
• The super laceability of the hypercubes
• The spanning connectivity of folded hypercubes
• The super spanning connectivity and super spanning laceability of tori with faulty elements

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 3641471 (Why is no real title available?)
• A group-theoretic model for symmetric interconnection networks
• Graph theory
• Hamilton connected graphs
• Hamiltonian properties on the class of hypercube-like networks
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• On \(3^*\)-connected graphs
• On some super fault-tolerant Hamiltonian graphs
• On the spanning connectivity of graphs
• Super-connectivity and super-edge-connectivity for some interconnection networks
• THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
• The Mobius cubes
• The super connectivity of the pancake graphs and the super laceability of the star graphs
• The super laceability of the hypercubes
• The super-connected property of recursive circulant graphs

Cited in

(21)

• Two spanning disjoint paths with required length in generalized hypercubes
• Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
• The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
• The super spanning connectivity of arrangement graphs
• On the spanning connectivity of the generalized Petersen graphs \(P(n, 3)\)
• The bipanconnectivity of bipartite hypercube-like networks
• Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks
• One-to-one disjoint path covers on multi-dimensional tori
• The spanning laceability on the faulty bipartite hypercube-like networks
• On the bipanpositionable bipanconnectedness of hypercubes
• The spanning connectivity of folded hypercubes
• Super spanning connectivity of split-star networks
• Polynomially determining spanning connectivity of locally connected line graphs
• Globally bi-3*-connected graphs
• On the equitable \(k^{*}\)-laceability of hypercubes
• 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
• Fault tolerance of hypercube like networks: spanning laceability under edge faults
• The super spanning connectivity and super spanning laceability of tori with faulty elements
• Spanning 3-connected index of graphs
• Edge-fault tolerance of hypercube-like networks

This page was built for publication: On the spanning connectivity and spanning laceability of hypercube-like networks

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