pith. sign in

arxiv: 1505.08133 · v2 · pith:KDLVKLAQnew · submitted 2015-05-29 · 🧮 math.OC

Spectrum of Laplacians for Graphs with Self-Loops

classification 🧮 math.OC
keywords self-loopsgraphsspectrumgraphlaplacianundirectedwithoutapply
0
0 comments X
read the original abstract

This note introduces a result on the location of eigenvalues, i.e., the spectrum, of the Laplacian for a family of undirected graphs with self-loops. We extend on the known results for the spectrum of undirected graphs without self-loops or multiple edges. For this purpose, we introduce a new concept of pseudo-connected graphs and apply a lifting of the graph with self-loops to a graph without self-loops, which is then used to quantify the spectrum of the Laplacian for the graph with self-loops.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.