# 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 be a block graph and let A(G) be its (0,1)-adjacency matrix. Graph G is called nonsingular (singular) if A(G) is nonsingular (singular). Characterizing nonsingular block graphs is an interesting open problem proposed by Bapat and Roy in 2013. In this article, we give a linear time algorithm to check whether a given block graph is singular or not.

03/11/2018

### Nonsingular Block Graphs: An Open Problem

A block graph is a graph in which every block is a complete graph (cliqu...
08/02/2019

### Independent Double Roman Domination on Block Graphs

Given a graph G=(V,E), f:V →{0,1,2 } is the Italian dominating function ...
05/06/2019

### Nonsingular (Vertex-Weighted) Block Graphs

A graph G is nonsingular (singular) if its adjacency matrix A(G) is nons...
09/09/2023

### Descriptive complexity of controllable graphs

Let G be a graph on n vertices with adjacency matrix A, and let 1 be the...
10/06/2022

### Block-Structured Optimization for Subgraph Detection in Interdependent Networks

We propose a generalized framework for block-structured nonconvex optimi...
06/25/2020

### A linear time algorithm for constructing orthogonal floor plans with minimum number of bends

Let G = (V, E) be a planar triangulated graph (PTG) having every face tr...
01/05/2020

### All non-trivial variants of 3-LDT are equivalent

The popular 3-SUM conjecture states that there is no strongly subquadrat...