Abstract
The problem of determining the number of spanning trees of graph having interesting structural properties such as the scale-free feature is attractive in science community. In this paper, we first present a class of outer-planar and self-similar graphs N(t) by using vertex-edge-growth operation. According to specific topological structure, we calculate the average degree, and show that the model N(t) is sparse. Then, we develop a series of iterative methods in order to obtain an exact solution of the total number of spanning trees of the model N(t), and also illustrate the corresponding spanning tree entropy. The calculation method used can be suitable for enumerating spanning trees of other graphs with similar properties.
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.
