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

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.

Authors

Institutions

Publication Details

Journal
Axioms
Published
2025-08-08
DOI
https://doi.org/10.3390/axioms14080622
Citations
2
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
8.18

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Salama Nagy Daoud, Ahmad Asiri
2 citations
Axioms
Graph theory and applications
8.18
article

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

Salama Nagy Daoud, Ahmad Asiri
article en
2 citations

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.

AxiomsVol. 14(8)
Taibah University (SA), Menoufia University (EG), King Khalid University (SA)
King Khalid University
Openalex Percentile: Top 3%
Graph theory and applications
8.18
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The Complexity of Classes of Pyramid Graphs Based on the Fritsch Graph and Its Related Graphs — Salama Nagy Daoud, Ahmad Asiri · Axioms (2025) | TGRS Research Map | TGRS