In this paper, the well-known Boolean n-cube networks are extended to the generalized Boolean n-cube networks which are based on a mixed radix number system. Although a classic theorem-the matrix tree theorem-can compute the number of spanning trees of any graph, however, we derive a simple formula for this general structure.
All Science Journal Classification (ASJC) codes
- Modelling and Simulation
- Computational Theory and Mathematics
- Computational Mathematics