<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Subdivision and graph eigenvalues</dc:title><dc:creator>Kumar,	Hitesh	(Avtor)
	</dc:creator><dc:creator>Mohar,	Bojan	(Avtor)
	</dc:creator><dc:creator>Pragada,	Shivaramakrishna	(Avtor)
	</dc:creator><dc:creator>Zhan,	Hanmeng	(Avtor)
	</dc:creator><dc:subject>graph eigenvalues</dc:subject><dc:subject>subdivision</dc:subject><dc:subject>adjacency matrix</dc:subject><dc:subject>interval multiplicity</dc:subject><dc:subject>unimodality</dc:subject><dc:description>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$. Given a graph, we show that after subdividing sufficiently many times, all but $O(1)$ 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.</dc:description><dc:date>2025</dc:date><dc:date>2025-02-24 14:25:54</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>167489</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>ISSN pri članku: 0024-3795</dc:identifier><dc:identifier>DOI: 10.1016/j.laa.2025.01.044</dc:identifier><dc:identifier>COBISS_ID: 227166211</dc:identifier><dc:language>sl</dc:language></metadata>
