37 citations · 59 across the 10 of their papers we have counts for
12 papers
11 can be reduced to 10
Abraham Berman, Eliyahu Levy
Laffey and Smigoc proved that for every 2x2 doubly nonnegative integer matrix A, icpr(A) is less than or equal to 11. We prove that 11 can be replaced by 10, and show that for many…
New constructions of non-regular cospectral graphs
Suliman Hamud, Abraham Berman
We consider two types of joins of graphs and , - the Neighbors Splitting Join and - the Non Neighbors Splitting J…
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…
Lights Out on graphs
Abraham Berman, Franziska Borer, Norbert Hungerbühler
We model the Lights Out game on general simple graphs in the framework of linear algebra over the field . Based upon a version of the Fredholm alternative, we introduc…
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…
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…