3 citations · 4 across the 8 of their papers we have counts for
9 papers
Computation of small reflective and dihedral Ramsey numbers
Ivan Damnjanović, Irena Đorđević
Throughout, all graphs are simple, finite and have vertex sets of the form for some . For graphs and , and a permutation gro…
-numerical radius of rank-one operators and the generalized Buzano inequality
Dušan Denčić, Hranislav Stanković, Mihailo Krstić +1
Here, we study the -numerical radius of rank-one operators on a Hilbert space . More precisely, for and , we establish the formu…
Nut graphs with a prescribed number of vertex and edge orbits
Nino Bašić, Ivan Damnjanović
A nut graph is a nontrivial graph whose adjacency matrix has a one-dimensional null space spanned by a vector without zero entries. Recently, it was shown that a nut graph has more…
An efficient algorithm for generating transmission irregular trees
Ivan Stošić, Ivan Damnjanović
The transmission of a vertex in a connected graph is the sum of distances from that vertex to all the other vertices. A connected graph is transmission irregular if any two distinc…
Classification of quartic bicirculant nut graphs
Ivan Damnjanović, Nino Bašić, Tomaž Pisanski +1
A graph is called a nut graph if zero is its eigenvalue of multiplicity one and its corresponding eigenvector has no zero entries. A graph is a bicirculant if it admits an automorp…
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…