Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs

DOI10.1016/J.AMC.2003.06.005MaRDI QIDQ1765415zbMATH OpenOpenAlexFDO

Authors Shin-Shin Kao, Lih-Hsing Hsu

Publication date 23 February 2005

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

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

zbMATH Keywords

bipartiteoptimal\(1_p\)-Hamiltonian\(1\)-edge Hamiltonian

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks
• Brother trees: A family of optimal 1p-Hamiltonian and 1-edge Hamiltonian graphs
• Tough spiders
• Spanning spiders and light-splitting switches
• Ring embedding in faulty honeycomb rectangular torus.

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• Christmas tree: a versatile 1-fault-tolerant design for token rings
• Hamiltonian graphs with minimum number of edges for fault-tolerant topologies
• Honeycomb tori are Hamiltonian
• Optimal 1-Hamiltonian graphs
• Parallel concepts in graph theory

Cited in

(9)

• Ubiquitous integrity via network integration and parallelism-sustaining pedestrian/bike urbanism
• On the facial Thue choice index of plane graphs
• Hamiltonian paths in some classes of grid graphs
• Globally bi-3*-connected graphs
• On spanning wide diameter of spider web networks
• The asymptotic optimality of spider-web networks
• On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem and its generalization
• On the induced matching problem in Hamiltonian bipartite graphs
• The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks

This page was built for publication: Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs

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