Work

Complexity trees of the sequence of some nonahedral graphs generated by triangle

Year: 2020

Type: article

Abstract: Calculating the number of spanning trees of a graph is one of the widely studied graph problems since the Pioneer Gustav Kirchhoff (1847). In this work, using knowledge of difference equations we drive the explicit formulas for the number of spanning trees in the sequence of some Nonahedral (nine faced polyhedral) graphs generated by triangle using electrically equivalent transformations and rules of the weighted generating function. Finally, we evaluate the entropy of graphs in this manuscript with different studied graphs with an average degree being 4, 5 and 6.

Source: Heliyon

DOI: 10.1016/j.heliyon.2020.e04786

Authors: S.N. Daoud, Wedad Saleh

Institutions: Taibah University, Menoufia University

Language: English

Topic: Graph theory and applications

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $1,750

Funder: Taibah University