Click here to flash read.
This paper investigates the asymptotic nature of graph spectra when some
edges of a graph are subdivided sufficiently many times. In the special case
where all edges of a graph are subdivided, we find the exact limits of the
$k$-th largest and $k$-th smallest eigenvalues for any fixed $k$. It is
expected that after subdivision, most eigenvalues of the new graph will lie in
the interval $[-2,2]$. We examine the eigenvalues of the new graph outside this
interval, and we prove several results that might be of independent interest.
Click here to read this post out
ID: 9784; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: March 21, 2023, 7:36 a.m.
Changes:
Dictionaries:
Words:
Spaces:
Views: 11
CC:
No creative common's license
No creative common's license
Comments: