The \(3^{*}\)-connected property of pyramid networks

DOI10.1016/J.CAMWA.2010.08.029zbMath1205.05129OpenAlexW2054156585MaRDI QIDQ623179

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

zbMATH Keywords

Hamiltonianconnectivitypyramid networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

The spanning laceability on the faulty bipartite hypercube-like networks

Cites Work

• The super connectivity of the pancake graphs and the super laceability of the star graphs
• A quadtree algorithm for template matching on a pyramid computer
• Algorithmic construction of Hamiltonians in pyramids
• Proof that pyramid networks are 1-Hamiltonian-connected with high probability
• The globally bi-\(3^{*}\)-connected property of the honeycomb rectangular torus
• Data Movement Techniques for the Pyramid Computer
• Fault tolerance properties of pyramid networks
• THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The \(3^{*}\)-connected property of pyramid networks