EUVIMEDEUVIMED entdecken
Crossref

Determinant Properties of the Laplacian Matrix for Graphs with Self-Loops

SAYED EHSANULLAH HASHIMI, MOHAMMAD WALI Hairan, MOHAMMAD KHAN HAIDARI

Kabul Polytechnic University International Journal of Engineering & Technology · 07.11.2026 · 6 (2) · 143-169

DOI: 10.68924/n7b1zd37 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Kabul Polytechnic University International Journal of Engineering & Technology, online erschienen am 07.11.2026. Verfasst von SAYED EHSANULLAH HASHIMI und 2 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Graph theory is a fundamental branch of discrete mathematics with deep connections to linear algebra. One of the principal tools for studying graph structures is their representation via associated matrices. Among the algebraic properties of these matrices, the determinant plays a crucial role in revealing structural characteristics such as singularity, non-singularity, and the presence of cycles or loops. In recent years, researchers have primarily focused on the determinant of adjacency matrices, while the determinant of the Laplacian matrix in the presence of self-loops has received less attention. This study specifically investigates the determinant of the Laplacian matrix for graph with self-loops. The analysis is conducted for three weel-know families of graph: complete graph, complete bipartite graphs, and star graphs. The investigation is supported by definitions, theorems, lemmas, and illustrative examples. Our findings show that, in contrast to the classical case for loop less graphs where the Laplacian determinant is zero (indicating singularity), the presence of at least one self-loop renders the Laplacian matrix non-singular and hence invertible. Moreover, both the number and the position of self-loops affect the determinant quantitatively, while the qualitative proparty of non-singularity remains consistent as long as at least one self-loop exists. The results obtained from the three graph families are consistent and confirm that self-loops fundamenntally alter the algebraic structure of the Laplacian matrix.

Zitieren

APA

HASHIMI, S. E., Hairan, M. W., & HAIDARI, M. K. (2026). Determinant Properties of the Laplacian Matrix for Graphs with Self-Loops. Kabul Polytechnic University International Journal of Engineering & Technology, 6(2), 143-169. https://doi.org/10.68924/n7b1zd37

Vancouver

HASHIMI SE, Hairan MW, HAIDARI MK. Determinant Properties of the Laplacian Matrix for Graphs with Self-Loops. Kabul Polytechnic University International Journal of Engineering & Technology. 2026;6(2):143-169. doi:10.68924/n7b1zd37

BibTeX
@article{HASHIMI2026,
  author = {HASHIMI, SAYED EHSANULLAH and Hairan, MOHAMMAD WALI and HAIDARI, MOHAMMAD KHAN},
  title = {Determinant Properties of the Laplacian Matrix for Graphs with Self-Loops},
  journal = {Kabul Polytechnic University International Journal of Engineering & Technology},
  year = {2026},
  volume = {6},
  number = {2},
  pages = {143--169},
  doi = {10.68924/n7b1zd37}
}
Kostenlos starten →