On spanning wide diameter of spider web networks
From MaRDI portal
Recommendations
- On the spanningw-wide diameter of the star graph
- Wide diameter and diameter of networks.
- Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
- Wide diameter for two families of interconnection networks
- The super spanning connectivity and super spanning laceability of tori with faulty elements
Cites work
- A group-theoretic model for symmetric interconnection networks
- A note on the Steiner k-diameter of tensor product networks
- A Novel Measurement for Network Reliability
- Component connectivity of augmented cubes
- Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes
- Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks
- Globally bi-3*-connected graphs
- Honeycomb tori are Hamiltonian
- scientific article; zbMATH DE number 524123 (Why is no real title available?)
- Mengerian properties, hamiltonicity, and claw‐free graphs
- Neighbor connectivity of pancake graphs and burnt pancake graphs
- On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
- On the spanningw-wide diameter of the star graph
- Restricted connectivity of Cayley graph generated by transposition trees
- Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
- Strong fault-Hamiltonicity for the crossed cube and its extensions
- Structure and Substructure Connectivity of Hypercube-Like Networks
- The fault-diameter and wide-diameter of twisted hypercubes
- The generalized 4-connectivity of pancake graphs
- The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks
- The super laceability of the hypercubes
- The vulnerability of the diameter of the enhanced hypercubes
- The wide-diameter of \(Z_{n, k}\)
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)
