17 citations · 22 across the 9 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021
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…
math.CO2021
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…
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…