Gallai-Edmonds decomposition of unicyclic graphs from null space

Abstract

In this paper, we compute the Gallai-Edmonds decomposition of a unicyclic graph G using linear algebraic tools. More precisely, the Gallai-Edmonds decomposition of G is obtained from the null space associated with adjacency matrices of its subtrees