Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
