Abstract

A network-theoretic approach for determining the complexity of a graph is proposed. This approach is based on the relationship between the linear algebra (theory of determinants) and the graph theory. In this paper we contribute a new algebraic method to derive simple formulas of the complexity of some new networks using linear algebra. We apply this method to derive the explicit formulas for the friendship network and the subdivision of friendship graph . We also calculate their spanning trees entropy and compare it between them. Finally, we introduce an open problem "Any improvement for calculating of the determinant in linear algebra, we can investigate this improvement as a new method to determine the number of spanning tree for a given graph.

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 call

Disclaimer: 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.