Counting Spanning Trees in Various Products of Two Complete Bipartite Graphs
Mathematics · 04.06.2026 · 14 (11) · 1996
DOI: 10.3390/math14111996 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 04.06.2026. Verfasst von Salama Nagy Daoud und 1 weiteren Autor:innen. Die Arbeit nennt 20 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: King Khalid University.
Abstract (Originalsprache)
Calculating the number of spanning trees in a graph is a crucial problem in combinatorics and physics that has been thoroughly researched for many years by mathematicians and physicists. The higher the quality and perfection of the network, the greater the number of trees spanning it, leading to greater possibilities for connection between two vertices and ensuring good rigidity and resistance. In this work, we use matrix theory and linear algebra techniques to derive simple explicit formulas for calculating the complexity of various products of two complete bipartite graphs, including the Cartesian product, tensor product, normal product, composition product, symmetric product, disjunction, and strong sum.
Förderung
- King Khalid University
Zitieren
APA
Daoud, S. N., & Asiri, A. (2026). Counting Spanning Trees in Various Products of Two Complete Bipartite Graphs. Mathematics, 14(11), 1996. https://doi.org/10.3390/math14111996
Vancouver
Daoud SN, Asiri A. Counting Spanning Trees in Various Products of Two Complete Bipartite Graphs. Mathematics. 2026;14(11):1996. doi:10.3390/math14111996
BibTeX
@article{Daoud2026,
author = {Daoud, Salama Nagy and Asiri, Ahmad},
title = {Counting Spanning Trees in Various Products of Two Complete Bipartite Graphs},
journal = {Mathematics},
year = {2026},
volume = {14},
number = {11},
pages = {1996},
doi = {10.3390/math14111996}
}
EUVIMED