Untitled

Abstract

The complexity of a graph can be determined using a network-theoretic method, which is given. This strategy is based on the connection between graph theory and the theory of determinants in linear algebra. In this article, we provide a unique algebraic method that makes use of linear algebra to derive simple formulas for the complexity of diverse novel networks. We can derive the explicit formulas for the globe network and its subdivision using this method. In the final least, we also determine their spanning trees entropy and compare it to each other.