Number of spanning Trees in the sequence of some Nonahedral graphs

Authors

  • Daoud S.N.

Abstract

A nonahedral graph is a polyhedral graph having nine vertices. 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 graphs such as Fritsch graph, Tridiminished icosahedron graph and (93) - configuration graph 2 by electrically equivalent transformations and rules of weighted generating function. Finally, we compare the entropy of our graphs with other studied graphs with average degree being 4,5 and 6. © 2020 Utilitas Mathematica Publishing Inc.. All rights reserved.

Published

2020-06-09

How to Cite

Daoud S.N. (2020). Number of spanning Trees in the sequence of some Nonahedral graphs. Utilitas Mathematica, 115. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/1498

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.