37 citations · 75 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…
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…
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)…