Normalized Laplacians for Gain Graphs
Abstract
We propose the notion of normalized Laplacian matrix L() for a gain graphs and study its properties in detail, providing insights and counterexamples along the way. We establish bounds for the eigenvalues of L() and characterize the classes of graphs for which equality holds. The relationships between the balancedness, bipartiteness, and their connection to the spectrum of L() are also studied. Besides, we extend the edge version of eigenvalue interlacing for the gain graphs. Thereupon, we determine the coefficients for the characteristic polynomial of L().
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.