Naomi Shaked-Monderer

activity

20172020

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

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

collaborators

Showing 2018Show all

3 papers · 1 filter

cs.DS2018

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 $G$ be a block graph and let $A (G)$ be its (0,1)-adjacency matrix. Graph $G$ is called nonsingular (singular)…

cs.DM2018

Rank of weighted digraphs with blocks

Ranveer Singh, Swarup Kumar Panda, Naomi Shaked-Monderer +1

Let $G$ be a digraph and $r (G)$ 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…

cs.DM2018

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 $G$ be a block graph and let $A (G)$ be its (0,1)-adjacency matrix. Graph $G$ is called nonsingular (singular)…