Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (1)

Search Parameters:
Keywords = graph sequence Johnson skeleton graph

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
35 pages, 8602 KB  
Article
Finding the Number of Spanning Trees in Specific Graph Sequences Generated by a Johnson Skeleton Graph
by Ahmad Asiri and Salama Nagy Daoud
Mathematics 2025, 13(18), 3036; https://doi.org/10.3390/math13183036 - 20 Sep 2025
Cited by 1 | Viewed by 1025
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 [...] Read more.
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. Full article
Show Figures

Figure 1

Back to TopTop