On Laplacian and Normalized Laplacian of a Social Network
V. Yegnanarayanan1, S.B. Pravallika2

1V. Yegnanarayanan*, School of Arts, Science and Humanities, SASTRA Deemed to be University, Thanjavur T.N, India.
2S.B. Pravallika, School of Computing, SASTRA Deemed to be University ,Thanjavur, TN, India. 

Manuscript received on October 14, 2019. | Revised Manuscript received on 23 October, 2019. | Manuscript published on November 10, 2019. | PP: 2075-2081 | Volume-9 Issue-1, November 2019. | Retrieval Number: A4217119119/2019©BEIESP | DOI: 10.35940/ijitee.A4217.119119
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: 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.
Keywords: Graph, Eigen Value, Spectrum, Laplacian, Normlized Laplacian, Social Network.
Scope of the Article: Graph Algorithms and Graph Drawing