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

DOI10.1016/J.TCS.2007.05.002zbMath1206.05060OpenAlexW2083507049MaRDI QIDQ995576

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

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) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (20)

The bipanconnectivity of bipartite hypercube-like networks ⋮ Polynomially determining spanning connectivity of locally connected line graphs ⋮ Two spanning disjoint paths with required length in generalized hypercubes ⋮ On the spanning connectivity of the generalized Petersen graphs \(P(n, 3)\) ⋮ Fault tolerance of hypercube like networks: spanning laceability under edge faults ⋮ Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks ⋮ One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes ⋮ Spanning 3-connected index of graphs ⋮ Edge-fault tolerance of hypercube-like networks ⋮ The spanning laceability on the faulty bipartite hypercube-like networks ⋮ Super spanning connectivity of split-star networks ⋮ Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs ⋮ The Super Spanning Connectivity of Arrangement Graphs ⋮ THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS ⋮ Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position ⋮ The spanning connectivity of folded hypercubes ⋮ On the bipanpositionable bipanconnectedness of hypercubes ⋮ Globally bi-3*-connected graphs ⋮ One-to-one disjoint path covers on multi-dimensional tori ⋮ The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The super connectivity of the pancake graphs and the super laceability of the star graphs
• Hamilton connected graphs
• The super laceability of the hypercubes
• On the spanning connectivity of graphs
• Super-connectivity and super-edge-connectivity for some interconnection networks
• On some super fault-tolerant Hamiltonian graphs
• Hamiltonian properties on the class of hypercube-like networks
• The super-connected property of recursive circulant graphs
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• A group-theoretic model for symmetric interconnection networks
• The Mobius cubes
• THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS

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