17 citations · 22 across the 9 of their papers we have counts for
11 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 \}…
A note on extremal Sombor indices of trees with a given degree sequence
Ivan Damnjanović, Marko Milošević, Dragan Stevanović
We note here that the problem of determining extremal values of Sombor index for trees with a given degree sequence fits within the framework of results by Hua Wang from [Cent. Eur…
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…
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 Hosoya's dormants and sprouts
Salem Al-Yakoob, Ali Kanso, Dragan Stevanović
In a recent series of papers, Hosoya drew the attention to a particular aspect of constructing cospectral graphs by using coalescences: that cospectral graphs can be constructed by…
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…
Ordering starlike trees by the totality of their spectral moments
Dragan Stevanović
The -th spectral moment of the adjacency matrix of a graph~ represents the number of closed walks of length~ in~. We study here the partial order of…
No two starlikes have equal index
Elismar R. Oliveira, Dragan Stevanović, Vilmar Trevisan
The index of a graph is the largest eigenvalue of its adjacency matrix. A starlike is a tree having a unique vertex of degree . We show how to order the starlike trees with $n…
On comparing Zagreb indices
Aleksandar Ilić, Dragan Stevanović
Let be a simple graph with vertices and edges. The first and second Zagreb indices are among the oldest and the most famous topological indices, defin…