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