Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
From MaRDI portal
Publication:1765415
DOI10.1016/J.AMC.2003.06.005zbMATH Open1057.05052OpenAlexW2133063816MaRDI QIDQ1765415FDOQ1765415
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
Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)
Cites Work
Cited In (9)
- On the 1-fault hamiltonicity for graphs satisfying Ore's theorem and its generalization
- 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
- On spanning wide diameter of spider web networks
- Globally bi-3*-connected graphs
- The asymptotic optimality of spider-web networks
- On the induced matching problem in Hamiltonian bipartite graphs
- The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks
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. π π
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)