
Nonsingular (VertexWeighted) Block Graphs
A graph G is nonsingular (singular) if its adjacency matrix A(G) is nons...
read it

Algorithm for Bpartitions, parameterized complexity of the matrix determinant and permanent
Every square matrix A=(a_uv)∈C^n× n can be represented as a digraph havi...
read it

Linear time algorithm to check the singularity of block graphs
A block graph is a graph in which every block is a complete graph. Let G...
read it

Rank of weighted digraphs with blocks
Let G be a digraph and r(G) be its rank. Many interesting results on the...
read it

Nonsingular Block Graphs: An Open Problem
A block graph is a graph in which every block is a complete graph (cliqu...
read it
Ranveer Singh
is this you? claim profile