On the spectra of the identity graph of a group
Amitariddhi Sinha, Jharna Kalita, Somnath Paul · Asian-European Journal of Mathematics · 2025
Let [Formula: see text] be a finite group. The identity graph [Formula: see text], denoted by [Formula: see text] is a simple, undirected graph with vertex set equal to [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are said to be adjacent if and only if [Formula: see text] or [Formula: see text] or [Formula: see text]. This paper discusses the spectra of adjacency, Laplacian, signless Laplacian, distance, distance Laplacian, and distance signless Laplacian matrices of [Formula: see text].