On spanning wide diameter of spider web networks
From MaRDI portal
Publication:6656778
DOI10.1142/S0129626424500063MaRDI QIDQ6656778
Publication date: 3 January 2025
Published in: Parallel Processing Letters (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- The wide-diameter of \(Z_{n, k}\)
- The super laceability of the hypercubes
- Globally bi-3*-connected graphs
- On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
- Honeycomb tori are Hamiltonian
- The fault-diameter and wide-diameter of twisted hypercubes
- Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
- Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks
- Neighbor connectivity of pancake graphs and burnt pancake graphs
- The generalized 4-connectivity of pancake graphs
- Restricted connectivity of Cayley graph generated by transposition trees
- The vulnerability of the diameter of the enhanced hypercubes
- The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks
- Component connectivity of augmented cubes
- A Novel Measurement for Network Reliability
- On the spanningw-wide diameter of the star graph
- A group-theoretic model for symmetric interconnection networks
- Mengerian properties, hamiltonicity, and claw‐free graphs
- Strong Fault-Hamiltonicity for the Crossed Cube and Its Extensions
- Structure and Substructure Connectivity of Hypercube-Like Networks
- A Note on the Steinerk-Diameter of Tensor Product Networks
- Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes
This page was built for publication: On spanning wide diameter of spider web networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6656778)
