3 papers
math.CO2026
Upper bounds for the Laplacian spectral radius: Proofs and counterexamples
Ivan Damnjanović, Taewoo Ha, Dragan Stevanović
The Laplacian spectral radius of a graph is the largest eigenvalue of its Laplacian matrix. Previously, upper bounds for the Laplacian spectral radius were proposed using a backwar…
math.CO2026
Some results on small ordered and cyclic Ramsey numbers
Nino Bašić, Ivan Damnjanović, Dragan Stevanović +1
Let and let be simple graphs such that for each , the vertex set of is $\{ 0, 1, 2, \ldots, n_j - 1 \}…
math.CO2021
On circulant nut graphs
Ivan Damnjanović, Dragan Stevanović
A nut graph is a simple graph whose adjacency matrix has the eigenvalue~0 with multiplicity~1 such that its corresponding eigenvector has no zero entries. Motivated by a question o…