Graph theoretic reliability analysis for the Boolean n cube networks
From MaRDI portal
Recommendations
- Graph theoretic characterization and reliability of the generalized Boolean n-cube network
- The number of spanning trees of the generalized Boolean \(n\)-cube network
- Reliability analysis of varietal hypercube networks
- Reliability properties of the hypercube network
- On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks
Cited in
(19)- On super edge-connectivity of product graphs
- Reliability properties of the hypercube network
- The number of spanning trees of the generalized Boolean \(n\)-cube network
- Broadcasting in a hypercube when some calls fail
- On connectivity of the cartesian product of two graphs
- Super-connectivity and super-edge-connectivity for some interconnection networks
- The number of spanning trees of the Cartesian product of regular graphs
- The number of spanning trees of the generalized hypercube network
- Realizability of fault-tolerant graphs
- On edge cut of graphs leaving components of order at least five
- Reliability analysis on the multiple-loop network
- scientific article; zbMATH DE number 806871 (Why is no real title available?)
- Planarity and hyperbolicity in graphs
- Restricted connectivity for some interconnection networks
- Graph theoretic characterization and reliability of the generalized Boolean n-cube network
- On optimizing edge connectivity of product graphs
- Bounds for neighbor connectivity of Cayley graphs generated by trees and unicyclic graphs
- Heuristic maximization of the number of spanning trees in regular graphs
- Graph theoretic characterization and reliability of the multiple-clique network
This page was built for publication: Graph theoretic reliability analysis for the Boolean n cube networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3804627)
