Results 1 to 10 of about 1,461 (78)

Enumerating the Number of Spanning Trees of Pyramid Graphs Based on Some Nonahedral Graphs

open access: yesAxioms
The enumeration of spanning trees in various graph forms has been made easier by the study of electrically equivalent transformations, which was motivated by Kirchhoff’s work on electrical networks.
Ahmad Asiri, Salama Nagy Daoud
doaj   +3 more sources

Complexity trees of the sequence of some nonahedral graphs generated by triangle

open access: yesHeliyon, 2020
Calculating the number of spanning trees of a graph is one of the widely studied graph problems since the Pioneer Gustav Kirchhoff (1847). In this work, using knowledge of difference equations we drive the explicit formulas for the number of spanning ...
S.N. Daoud, Wedad Saleh
doaj   +1 more source

Carroll contractions of Lorentz-invariant theories

open access: yesJournal of High Energy Physics, 2021
We consider Carroll-invariant limits of Lorentz-invariant field theories. We show that just as in the case of electromagnetism, there are two inequivalent limits, one “electric” and the other “magnetic”.
Marc Henneaux   +1 more
doaj   +1 more source

Enumeration of spanning trees in the sequence of Dürer graphs

open access: yesOpen Mathematics, 2017
In this paper, we calculate the number of spanning trees in the sequence of Dürer graphs with a special feature that it has two alternate states. Using the electrically equivalent transformations, we obtain the weights of corresponding equivalent graphs ...
Li Shixing
doaj   +1 more source

Number of Spanning Trees in the Sequence of Some Graphs

open access: yesComplexity, 2019
In mathematics, one always tries to get new structures from given ones. This also applies to the realm of graphs, where one can generate many new graphs from a given set of graphs.
Jia-Bao Liu, S. N. Daoud
doaj   +1 more source

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

open access: yesMathematics
Using equivalent transformations, complicated circuits in physics that need numerous mathematical operations to analyze can be broken down into simpler equivalent circuits.
Ahmad Asiri, Salama Nagy Daoud
doaj   +1 more source

On the Number of Spanning Trees in Augmented Triangular Prism Graphs

open access: yesMathematics
In computer science and graph theory, prism and antiprism graphs are crucial for network modeling, optimization, and network connectivity comprehension.
Ahmad Asiri, Salama Nagy Daoud
doaj   +1 more source

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

open access: yesAxioms
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 ...
Ahmad Asiri, Salama Nagy Daoud
doaj   +1 more source

Monopoles, Dirac strings and generalised symmetries

open access: yesJournal of High Energy Physics
Dirac’s formulation of magnetic monopoles is shown to be equivalent to Maxwell theory coupled to 2-form gauge fields so that it has a local 1-form symmetry, with the 2-form gauge fields given in terms of the 2-form current densities associated with the ...
C. M. Hull
doaj   +1 more source

Current-induced creation and dynamics of embedded magnetic skyrmion bags. [PDF]

open access: yesNat Commun
Wu Y   +7 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy