Previous Article in Journal
On the Definability Problem of First-Order Sentences by Propositional Intuitionistic Formulas
Previous Article in Special Issue
Odd Cycles in Conditionally Faulty Enhanced Hypercube Networks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Article

The Complexity of Classes of Pyramid Graphs Based on the Fritsch Graph and Its Related Graphs

1
Department of Mathematics, Applied College at Mahail Aseer, King Khalid University, Abha 61421, Saudi Arabia
2
Department of Mathematics, Faculty of Science, Taibah University, Al-Madinah Al-Nunawara 30001, Saudi Arabia
3
Department of Mathematics and Computer Sciences, Faculty of Science, Menoufia University, Shebin El Kom 32511, Egypt
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(8), 622; https://doi.org/10.3390/axioms14080622
Submission received: 5 June 2025 / Revised: 29 July 2025 / Accepted: 6 August 2025 / Published: 8 August 2025
(This article belongs to the Special Issue Graph Theory and Combinatorics: Theory and Applications)

Abstract

A quantitative study of the complicated three-dimensional structures of artificial atoms in the field of intense matter physics requires a collaborative method that combines a statistical analysis of unusual graph features related to atom topology. Simplified circuits can also be produced by using similar transformations to streamline complex circuits that need laborious mathematical calculations during analysis. These modifications can also be used to determine the number of spanning trees required for specific graph families. The explicit derivation of formulas to determine the number of spanning trees for novel pyramid graph types based on the Fritsch graph, which is one of only six graphs in which every neighborhood is a 4- or 5-vertex cycle, is the focus of our study. We conduct this by utilizing our understanding of difference equations, weighted generating function rules, and the strength of analogous transformations found in electrical circuits.
Keywords: number of spanning trees; pyramid graph; Fritsch graph; electrically equivalent transformations number of spanning trees; pyramid graph; Fritsch graph; electrically equivalent transformations

Share and Cite

MDPI and ACS Style

Asiri, A.; Daoud, S.N. The Complexity of Classes of Pyramid Graphs Based on the Fritsch Graph and Its Related Graphs. Axioms 2025, 14, 622. https://doi.org/10.3390/axioms14080622

AMA Style

Asiri A, Daoud SN. The Complexity of Classes of Pyramid Graphs Based on the Fritsch Graph and Its Related Graphs. Axioms. 2025; 14(8):622. https://doi.org/10.3390/axioms14080622

Chicago/Turabian Style

Asiri, Ahmad, and Salama Nagy Daoud. 2025. "The Complexity of Classes of Pyramid Graphs Based on the Fritsch Graph and Its Related Graphs" Axioms 14, no. 8: 622. https://doi.org/10.3390/axioms14080622

APA Style

Asiri, A., & Daoud, S. N. (2025). The Complexity of Classes of Pyramid Graphs Based on the Fritsch Graph and Its Related Graphs. Axioms, 14(8), 622. https://doi.org/10.3390/axioms14080622

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop