8 citations · 15 across the 8 of their papers we have counts for
9 papers
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…
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 \}…
Complete resolution of the circulant nut graph order-degree existence problem
Ivan Damnjanović
A circulant nut graph is a non-trivial simple graph such that its adjacency matrix is a circulant matrix whose null space is spanned by a single vector without zero elements. Regar…
Greedy trees have minimum Sombor indices
Ivan Damnjanović, Dragan Stevanović
Recently, Gutman [MATCH Commun. Math. Comput. Chem. 86 (2021) 11-16] defined a new graph invariant which is named the Sombor index of a graph and is computed v…
Spectral properties of balanced trees and dendrimers
Ivan Damnjanović, Slobodan Filipovski, Dragan Stevanović
We investigate the spectral properties of balanced trees and dendrimers, with a view toward unifying and improving the existing results. Here we find a semi-factorized formula for…
Two families of circulant nut graphs
Ivan Damnjanović
A circulant nut graph is a non-trivial simple graph whose adjacency matrix is a circulant matrix of nullity one such that its non-zero null space vectors have no zero elements. The…
Assigned rational functions of a rooted tree
Ivan Damnjanović
We investigate the spectral properties of rooted trees with the intention of improving the currently existing results that deal with this matter. The concept of an assigned rationa…
Finding counterexamples for a conjecture of Akbari, Alazemi and Andjelić
Đorđe Stevanović, Ivan Damnjanović, Dragan Stevanović
For a graph , its energy is the sum of absolute values of the eigenvalues of its adjacency matrix, the matching number is the number of edges in a maximu…
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…