English

Normalized Laplacians for Gain Graphs

Combinatorics 2022-03-11 v2

Abstract

We propose the notion of normalized Laplacian matrix L(Φ)\mathcal{L}(\Phi) 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(Φ)\mathcal{L}(\Phi) and characterize the classes of graphs for which equality holds. The relationships between the balancedness, bipartiteness, and their connection to the spectrum of L(Φ)\mathcal{L}(\Phi) 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(Φ)\mathcal{L}(\Phi).

Keywords

Cite

@article{arxiv.2009.13788,
  title  = {Normalized Laplacians for Gain Graphs},
  author = {M. Rajesh Kannan and Navish Kumar and Shivaramakrishna Pragada},
  journal= {arXiv preprint arXiv:2009.13788},
  year   = {2022}
}

Comments

20 Pages

R2 v1 2026-06-23T18:52:07.262Z