3 citations · 4 across the 8 of their papers we have counts for
4 papers · 1 filter
Some bounds on the spectral radius of connected threshold graphs
Péter Csikvári, Ivan Damnjanović, Dragan Stevanović +1
The spectral radius of a graph is the spectral radius of its adjacency matrix. A threshold graph is a simple graph whose vertices can be ordered as , so that…
On cubic polycirculant nut graphs
Nino Bašić, Ivan Damnjanović
A nut graph is a nontrivial simple graph whose adjacency matrix contains a one-dimensional null space spanned by a vector without zero entries. Moreover, an -circulant graph…
On the degrees of regular nut graphs and Cayley nut graphs
Nino Bašić, Ivan Damnjanović, Patrick W. Fowler
A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. It is known that infinitely…
A polynomial GCD certificate for exact flat bands in finite-range Bloch Hamiltonians
Ivan Damnjanović, Milan Damnjanović, Ivanka Milošević +1
We formulate a polynomial GCD certificate for exact flat bands in finite-range periodic tight-binding Hamiltonians. Writing the characteristic polynomial of the Bloch Hamiltonian a…