The 3^*-connected property of pyramid networks
From MaRDI portal
Publication:623179
DOI10.1016/J.CAMWA.2010.08.029zbMATH Open1205.05129OpenAlexW2054156585MaRDI QIDQ623179FDOQ623179
Authors: Yuan-Hsiang Teng, Tzu-Liang Kung, Lih-Hsing Hsu
Publication date: 13 February 2011
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2010.08.029
Recommendations
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The super connectivity of the pancake graphs and the super laceability of the star graphs
- THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
- On \(3^*\)-connected graphs
- Proof that pyramid networks are 1-Hamiltonian-connected with high probability
- Fault tolerance properties of pyramid networks
- A quadtree algorithm for template matching on a pyramid computer
- Algorithmic construction of Hamiltonians in pyramids
- The globally bi-\(3^{*}\)-connected property of the honeycomb rectangular torus
- Title not available (Why is that?)
- Data Movement Techniques for the Pyramid Computer
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)