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

DOI10.1016/J.AMC.2004.12.016zbMATH Open1080.05052OpenAlexW1971520277MaRDI QIDQ2572044FDOQ2572044

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

Recommendations

• Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
• The globally bi-\(3^{*}\)-connected property of the honeycomb rectangular torus
• Globally bi-3*-connected graphs
• scientific article; zbMATH DE number 2038756
• The asymptotic optimality of spider-web networks

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The super connectivity of the pancake graphs and the super laceability of the star graphs
• Optimal 1-Hamiltonian graphs
• Christmas tree: a versatile 1-fault-tolerant design for token rings
• Embedding a ring in a hypercube with both faulty links and faulty nodes
• Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
• On the construction of combined \(k\)-fault-tolerant Hamiltonian graphs
• On \(3^*\)-connected graphs
• Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs

Cited In (3)

• Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
• On spanning wide diameter of spider web networks
• Globally bi-3*-connected graphs

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

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