Gallai-Edmonds decomposition of unicyclic graphs from null space

View/Open
Date
2022
Author
Type
URI
http://hdl.handle.net/10183/256727
Subject
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.
In
American Journal of Combinatorics. Flagstaff. Vol. 1 (2022), p. 47–64
Source
Foreign
Collections
 
   

This item is licensed under a Creative Commons License