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

DOI10.1016/j.amc.2003.06.005zbMath1057.05052OpenAlexW2133063816MaRDI QIDQ1765415

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) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

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

Cites Work

• Optimal 1-Hamiltonian graphs
• Christmas tree: a versatile 1-fault-tolerant design for token rings
• Hamiltonian graphs with minimum number of edges for fault-tolerant topologies
• Parallel concepts in graph theory
• Honeycomb tori are Hamiltonian
• Unnamed Item

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