Related Experiment Video
Updated: Dec 8, 2025

Self-assembly of Complex Two-dimensional Shapes from Single-stranded DNA Tiles
Published on: May 8, 2015
Complexity trees of the sequence of some nonahedral graphs generated by triangle
S N Daoud1,2, Wedad Saleh1
1Department of Mathematics, Faculty of Science, Taibah University, Al-Madinah 41411, Saudi Arabia.
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.
More Related Videos
Related Concept Videos
Phylogenetic Trees
Sequences
Sequence Networks of Rotating Machines
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
Geometric Sequences
Coordination Number and Geometry
Space Trusses
At the core of a space truss lies the fundamental unit known as the tetrahedron. This structure is composed of six members that form a three-dimensional shape...

