The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks

DOI10.1016/j.amc.2004.12.016zbMath1080.05052OpenAlexW1971520277MaRDI QIDQ2572044

Lih-Hsing Hsu, Shin-Shin Kao

Publication date: 14 November 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.12.016

zbMATH Keywords

connectivityglobally bi-3*-connectedhyper bi-3*-connected

Mathematics Subject Classification ID

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

Related Items (1)

Globally bi-3*-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal 1-Hamiltonian graphs
• Christmas tree: a versatile 1-fault-tolerant design for token rings
• The super connectivity of the pancake graphs and the super laceability of the star graphs
• Embedding a ring in a hypercube with both faulty links and faulty nodes
• Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs
• Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
• On the construction of combinedk-fault-tolerant Hamiltonian graphs

This page was built for publication: The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks