Gallai-Edmonds decomposition of unicyclic graphs from null space
American Journal of Combinatorics · 2022
DOI: 10.63151/amjc.v1i.6 ↗Kurz gefasst
Fachartikel in der Zeitschrift American Journal of Combinatorics, 2022. Verfasst von Luiz Emilio Allem und 3 weiteren Autor:innen.
Abstract (Originalsprache)
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.
Zitieren
APA
Allem, L. E., Jaume, D., Molina, G., & Toledo, M. (2022). Gallai-Edmonds decomposition of unicyclic graphs from null space. American Journal of Combinatorics. https://doi.org/10.63151/amjc.v1i.6
Vancouver
Allem LE, Jaume D, Molina G, Toledo M. Gallai-Edmonds decomposition of unicyclic graphs from null space. American Journal of Combinatorics. 2022. doi:10.63151/amjc.v1i.6
BibTeX
@article{Allem2022,
author = {Allem, Luiz Emilio and Jaume, Daniel and Molina, Gonzalo and Toledo, Maikon},
title = {Gallai-Edmonds decomposition of unicyclic graphs from null space},
journal = {American Journal of Combinatorics},
year = {2022},
doi = {10.63151/amjc.v1i.6}
}
EUVIMED