Mostrar el registro sencillo del ítem
Gallai-Edmonds decomposition of unicyclic graphs from null space
dc.contributor.author | Allem, Luiz Emílio | pt_BR |
dc.contributor.author | Jaume, Daniel Alejandro | pt_BR |
dc.contributor.author | Molina, Gonzalo | pt_BR |
dc.contributor.author | Toledo, Maikon Machado | pt_BR |
dc.date.accessioned | 2023-04-05T03:48:04Z | pt_BR |
dc.date.issued | 2022 | pt_BR |
dc.identifier.issn | 2768-4202 | pt_BR |
dc.identifier.uri | http://hdl.handle.net/10183/256727 | pt_BR |
dc.description.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. | en |
dc.format.mimetype | application/pdf | pt_BR |
dc.language.iso | eng | pt_BR |
dc.relation.ispartof | American Journal of Combinatorics. Flagstaff. Vol. 1 (2022), p. 47–64 | pt_BR |
dc.rights | Open Access | en |
dc.subject | Unicyclic graph | en |
dc.subject | Decomposição : Matemática | pt_BR |
dc.subject | Null space | en |
dc.subject | Grafos | pt_BR |
dc.subject | Null decomposition | en |
dc.subject | Gallai-Edmonds decomposition | en |
dc.title | Gallai-Edmonds decomposition of unicyclic graphs from null space | pt_BR |
dc.type | Artigo de periódico | pt_BR |
dc.identifier.nrb | 001163853 | pt_BR |
dc.type.origin | Estrangeiro | pt_BR |
Ficheros en el ítem
Este ítem está licenciado en la Creative Commons License
-
Artículos de Periódicos (40021)Ciencias Exactas y Naturales (6101)