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

Authors

  • SAYED EHSANULLAH HASHIMI Kabul University Author
  • MOHAMMAD WALI Hairan Author
  • MOHAMMAD KHAN HAIDARI Author

DOI:

https://doi.org/10.68924/n7b1zd37

Keywords:

Complete graph, Determinant, Graph, Laplacian matrix, Self-Loop, Star graph

Abstract

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.

Downloads

Published

2026-10-31 — Updated on 2026-11-07

Versions

Issue

Section

Articles

How to Cite

Determinant Properties of the Laplacian Matrix for Graphs with Self-Loops. (2026). Kabul Polytechnic University International Journal of Engineering & Technology, 6(2), 143-169. https://doi.org/10.68924/n7b1zd37 (Original work published 2026)

Similar Articles

You may also start an advanced similarity search for this article.