research
∙
11/23/2022
A note on graphs with purely imaginary per-spectrum
In 1983, Borowiecki and Jóźwiak posed an open problem of characterizing ...
share
research
∙
05/06/2019
Nonsingular (Vertex-Weighted) Block Graphs
A graph G is nonsingular (singular) if its adjacency matrix A(G) is nons...
research
∙
10/10/2018
Algorithm for B-partitions, parameterized complexity of the matrix determinant and permanent
Every square matrix A=(a_uv)∈C^n× n can be represented as a digraph havi...
research
∙
08/10/2018
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...
research
∙
07/11/2018
Rank of weighted digraphs with blocks
Let G be a digraph and r(G) be its rank. Many interesting results on the...
research
∙
03/11/2018
