Year: 2025
Type: article
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.
Source: Interciencia
DOI: 10.59671/gjsnz
Authors: Ahmad Asiri, S. N. Daoud
Institutions: King Khalid University, Taibah University, Menoufia University
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
Funder: King Khalid University
Award: G7812605765
OpenAlex ID: W4406818212