The 3^*-connected property of pyramid networks
From MaRDI portal
Publication:623179
Recommendations
Cites work
- scientific article; zbMATH DE number 4033059 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- A quadtree algorithm for template matching on a pyramid computer
- Algorithmic construction of Hamiltonians in pyramids
- Data Movement Techniques for the Pyramid Computer
- Fault tolerance properties of pyramid networks
- On \(3^*\)-connected graphs
- Proof that pyramid networks are 1-Hamiltonian-connected with high probability
- THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
- The globally bi-\(3^{*}\)-connected property of the honeycomb rectangular torus
- The super connectivity of the pancake graphs and the super laceability of the star graphs
Cited in
(4)
This page was built for publication: The \(3^{*}\)-connected property of pyramid networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623179)