37 citations · 59 across the 10 of their papers we have counts for
3 papers · 1 filter
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…