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.
Shranjeno v:
| Principais autores: | , , , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
American Journal of Combinatorics
2022-08-01
|
| Serija: | The American Journal of Combinatorics |
| Teme: | |
| Online dostop: | https://ajcombinatorics.org/ojs/index.php/AmJC/article/view/6 |
| Oznake: |
Brez oznak, prvi označite!
|