Mostrar registro simples

dc.contributor.authorAllem, Luiz Emíliopt_BR
dc.contributor.authorJaume, Daniel Alejandropt_BR
dc.contributor.authorMolina, Gonzalopt_BR
dc.contributor.authorToledo, Maikon Machadopt_BR
dc.date.accessioned2023-04-05T03:48:04Zpt_BR
dc.date.issued2022pt_BR
dc.identifier.issn2768-4202pt_BR
dc.identifier.urihttp://hdl.handle.net/10183/256727pt_BR
dc.description.abstractIn 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.mimetypeapplication/pdfpt_BR
dc.language.isoengpt_BR
dc.relation.ispartofAmerican Journal of Combinatorics. Flagstaff. Vol. 1 (2022), p. 47–64pt_BR
dc.rightsOpen Accessen
dc.subjectUnicyclic graphen
dc.subjectDecomposição : Matemáticapt_BR
dc.subjectNull spaceen
dc.subjectGrafospt_BR
dc.subjectNull decompositionen
dc.subjectGallai-Edmonds decompositionen
dc.titleGallai-Edmonds decomposition of unicyclic graphs from null spacept_BR
dc.typeArtigo de periódicopt_BR
dc.identifier.nrb001163853pt_BR
dc.type.originEstrangeiropt_BR


Thumbnail
   

Este item está licenciado na Creative Commons License

Mostrar registro simples