37 citations · 75 across the 10 of their papers we have counts for
12 papers
On the number of CP factorizations of a completely positive matrix
Naomi Shaked-Monderer
A square matrix is completely positive if , where is a (not necessarily square) nonnegative matrix. In general, a completely positive matrix may have many, even inf…
Nonsingular (Vertex-Weighted) Block Graphs
Ranveer Singh, Cheng Zheng, Naomi Shaked-Monderer +1
A graph is \emph{nonsingular (singular)} if its adjacency matrix is nonsingular (singular). In this article, we consider the nonsingularity of block graphs, i.e., graphs…
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)…
Rank of weighted digraphs with blocks
Ranveer Singh, Swarup Kumar Panda, Naomi Shaked-Monderer +1
Let be a digraph and be its rank. Many interesting results on the rank of an undirected graph appear in the literature, but not much information about the rank of a digr…
Nonsingular Block Graphs: An Open Problem
Ranveer Singh, Cheng Zheng, Naomi Shaked-Monderer +1
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)…
Corrigendum to "SPN graphs: when copositive SPN"
Naomi Shaked-Monderer
In this corrigendum, an error in the proof of a theorem in [Linear Algebra and its Applications 509 (2016) 82--113] is pointed out. This theorem states that every graph consi…
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…
On the maximum angle between copositive matrices
Felix Goldberg, Naomi Shaked-Monderer
Hiriart-Urruty and Seeger have posed the problem of finding the maximal possible angle between two copositive matrices of order . They have proved th…
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…