8 citations · 26 across the 11 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2019
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…
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)…