EUVIMEDEUVIMED entdecken
Crossref

Normalized Laplacians for gain graphs

M. Rajesh Kannan, Navish Kumar, Shivaramakrishna Pragada

American Journal of Combinatorics · 2022

DOI: 10.63151/amjc.v1i.3 ↗

Kurz gefasst

Fachartikel in der Zeitschrift American Journal of Combinatorics, 2022. Verfasst von M. Rajesh Kannan und 2 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We propose the notion of normalized Laplacian matrix \(\mathcal{L}(\Phi)\) for a gain graph \(\Phi\) and study its properties in detail, providing insights and counterexamples along the way. We establish bounds for the eigenvalues of \(\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 \(\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 \(\mathcal{L}(\Phi)\).

Zitieren

APA

Kannan, M. R., Kumar, N., & Pragada, S. (2022). Normalized Laplacians for gain graphs. American Journal of Combinatorics. https://doi.org/10.63151/amjc.v1i.3

Vancouver

Kannan MR, Kumar N, Pragada S. Normalized Laplacians for gain graphs. American Journal of Combinatorics. 2022. doi:10.63151/amjc.v1i.3

BibTeX
@article{Kannan2022,
  author = {Kannan, M. Rajesh and Kumar, Navish and Pragada, Shivaramakrishna},
  title = {Normalized Laplacians for gain graphs},
  journal = {American Journal of Combinatorics},
  year = {2022},
  doi = {10.63151/amjc.v1i.3}
}
Kostenlos starten →