2000 character limit reached
A few properties of the eigenvalues of normalized graph Laplacian
Published 18 Oct 2012 in math.CO and cs.DM | (1210.5091v2)
Abstract: Here we have investigated a few properties of the eigenvalues of normalized (geometric) graph Laplacian in different graphs. Preservation of eigenvalue 1 from a particular subgraph to the entire graph, the spectrum of the graph constructed with triangles share a common vertex have been addressed. Further using the number and degrees of common neighbors between vertices some new upper bounds for the largest eigenvalue have been introduced.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.