4 papers
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…
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…