Abstract
The number of spanning trees is an important quantity characterizing the reliability of a network. In this paper, we find the explicit formulas of the number of spanning trees of some new of the families of sequence graphs generated by triangle graph with its special feature in iteration. Using the electrically equivalent transformations, we obtain the weights of corresponding equivalent graphs and we further derive relationships for spanning trees between these graphs and transformed graphs. Finally, we compare the entropy of our graphs together and with other studied graphs of average degree.
Full Text
Published Version
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