Linear time algorithm to check the singularity of block graphs
Data Structures and Algorithms
2018-11-21 v2
Abstract
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) if 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.
Cite
@article{arxiv.1808.03411,
title = {Linear time algorithm to check the singularity of block graphs},
author = {Ranveer Singh and Naomi Shaked-Monderer and Avi Berman},
journal= {arXiv preprint arXiv:1808.03411},
year = {2018}
}