37 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
6 papers
Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum
Abraham Berman, Shaked-Monderer, Ranveer Singh +1
It is known that complete multipartite graphs are determined by their distance spectrum but not by their adjacency spectrum. The Seidel spectrum of a graph on more than one ver…
Linear time algorithm to check the singularity of block graphs
Ranveer Singh, Naomi Shaked-Monderer, Avi Berman
A block graph is a graph in which every block is a complete graph. Let be a block graph and let be its (0,1)-adjacency matrix. Graph is called nonsingular (singular)…
SPN graphs: when copositive=SPN
Naomi Shaked-Monderer
A real symmetric matrix is copositive if for every nonnegative vector . A matrix is SPN if it is a sum of a real positive semidefinite matrix and a nonnegative…
On the DJL conjecture for order 6
Naomi Shaked-Monderer
In 1994 Drew, Johnson and Loewy conjectured that for , the cp-rank of any completely positive matrices is at most . Recently this conj…
On weakly irreducible nonnegative tensors and interval hull of some classes of tensors
M. Rajesh Kannan, Naomi Shaked-Monderer, Abraham Berman
In this article we prove the strict monotonicity of the spectral radius of weakly irreducible nonnegative tensors. As an application, we give a necessary and sufficient condition f…
New results on the cp rank and related properties of co(mpletely)positive matrices
Naomi Shaked-Monderer, Abraham Berman, Immanuel M. Bomze +2
Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The…