In the task of structural identification of a network a vital tool is the underlying spectrum associated with the normalized graph Laplacian. To comprehend such spectrum, we need to determine the eigenvalues. In this paper we have found certain useful bounds involving the eigenvalues of both combinatorial Laplacian and normalized Laplacian and applied the same on a collaboration graph obtained from a social network.
CITATION STYLE
Yegnanarayanan, V., & Pravallika, S. B. (2019). On Laplacian and normalized Laplacian of a social network. International Journal of Innovative Technology and Exploring Engineering, 9(1), 2075–2081. https://doi.org/10.35940/ijitee.A4217.119119
Mendeley helps you to discover research relevant for your work.