A. Berman

most citedComplete multipartite graphs that are determined, up to switching, by their Seidel spectrum

10 citations · 10 across the 1 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2019

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 $F_{2}$ . Based upon a version of the Fredholm alternative, we introduc…

math.CO2019★ 10 cited

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 $G$ on more than one ver…

math.CO2018

A family of graphs that are determined by their normalized Laplacian spectra

Abraham Berman, Dong-Mei Chen, Zhi-Bing Chen +2

Let $F_{p, q}$ be the generalized friendship graph $K_{1} ⋁ (p K_{q})$ on $pq + 1$ vertices obtained by joining a vertex to all vertices of $p$ disjoint copies of the complete graph $…