Gallai-Edmonds decomposition of unicyclic graphs from null space
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.
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Journal of Combinatorics
2022-08-01
|
| Series: | The American Journal of Combinatorics |
| Subjects: | |
| Online Access: | https://ajcombinatorics.org/Volume1/V1.04.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|