Graph theoretic reliability analysis for the Boolean n cube networks

DOI10.1109/31.7582zbMath0656.94027OpenAlexW2046357511MaRDI QIDQ3804627

No author found.

Publication date: 1988

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/31.7582

zbMATH Keywords

spanning treessuper line-connectivitymaximum line connectivitynetwork reliability of the Boolean \(n\)-cube network

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items (16)

On edge cut of graphs leaving components of order at least five ⋮ Reliability properties of the hypercube network ⋮ Heuristic maximization of the number of spanning trees in regular graphs ⋮ The number of spanning trees of the generalized Boolean \(n\)-cube network ⋮ Reliability analysis on the multiple-loop network ⋮ On optimizing edge connectivity of product graphs ⋮ Super-connectivity and super-edge-connectivity for some interconnection networks ⋮ Graph theoretic characterization and reliability of the multiple-clique network ⋮ The number of spanning trees of the Cartesian product of regular graphs ⋮ Broadcasting in a hypercube when some calls fail ⋮ Planarity and hyperbolicity in graphs ⋮ Restricted connectivity for some interconnection networks ⋮ On super edge-connectivity of product graphs ⋮ The number of spanning trees of the generalized hypercube network ⋮ On connectivity of the cartesian product of two graphs ⋮ Realizability of fault-tolerant graphs

This page was built for publication: Graph theoretic reliability analysis for the Boolean n cube networks