Graph theoretic characterization and reliability of the generalized Boolean n-cube network

DOI10.1016/0167-8191(89)90095-1zbMath0689.68078OpenAlexW2053012867MaRDI QIDQ582109

Jau-Yien Lee, Jhing-Fa Wang, Tsung-Chuan Huang, Chu-Sing Yang

Publication date: 1989

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(89)90095-1

zbMATH Keywords

interconnection networksnetwork connectivityarray processorsBoolean n-cube network

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Connectivity (05C40) Theory of software (68N99)

Related Items (1)

The number of spanning trees of the generalized Boolean \(n\)-cube network

This page was built for publication: Graph theoretic characterization and reliability of the generalized Boolean n-cube network