الوصف

URL

DOI

doi.org/10.3390/computation11080162

الملخص

The complexity (number of spanning trees) in a finite graph Γ (network) is crucial. The quantity of spanning trees is a fundamental indicator for assessing the dependability of a network. The best and most dependable network is the one with the most spanning trees. In graph theory, one constantly strives to create novel structures from existing ones. The super subdivision operation produces more complicated networks, and the matrices of these networks can be divided into block matrices. Using methods from linear algebra and the characteristics of block matrices, we derive explicit formulas for determining the complexity of the super subdivision of a certain family of graphs, including the cycle Cn; the dumbbell graph ; the dragon graph ; the prism graph ; the cycle Cn with a Pn -chord; and the complete graph

الكلمات الدالة

complexity; super subdivision; dragon graph; cycle with a chord; dumbbell graph