Work

Finding the Number of Spanning Trees in Specific Graph Sequences Generated by a Johnson Skeleton Graph

Year: 2025

Type: article

Abstract: Using equivalent transformations, complicated circuits in physics that need numerous mathematical operations to analyze can be broken down into simpler equivalent circuits. It is also possible to determine the number of spanning trees—graph families in particular—using these adjustments and utilizing our knowledge of difference equations, electrically equivalent transformations, and weighted generating function rules. In this paper, we derive the exact formulas for the number of spanning trees of sequences of new graph families created by a Johnson skeleton graph 63 and a few of its related graphs. Lastly, a comparison is made between our graphs’ entropy and other graphs of average degree four.

Source: Mathematics

DOI: 10.3390/math13183036

Authors: Ahmad Asiri, Salama Nagy Daoud

Institutions: King Khalid University, Taibah University, Menoufia University

Language: English

Topic: Graph theory and applications

Subfield: Geometry and Topology

Field: Mathematics

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $3,137

Funder: King Khalid University