37 citations · 59 across the 10 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DM2018
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…
math.CO2018
A family of graphs that are determined by their normalized Laplacian spectra
Abraham Berman, Dong-Mei Chen, Zhi-Bing Chen +2
Let be the generalized friendship graph on vertices obtained by joining a vertex to all vertices of disjoint copies of the complete graph $…
cs.DM2018★ 2 cited
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)…