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.contributor.authorTrevisan, Vilmarpt_BR
dc.date.accessioned2021-07-14T04:31:33Zpt_BR
dc.date.issued2020pt_BR
dc.identifier.issn0101-8205pt_BR
dc.identifier.urihttp://hdl.handle.net/10183/223853pt_BR
dc.description.abstractWe characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on the support of its subtrees. These formulas allows one to compute independence and matching numbers of unicyclic graphs using linear algebra methods.en
dc.format.mimetypeapplication/pdfpt_BR
dc.language.isoengpt_BR
dc.relation.ispartofMatemática aplicada e computacional. São Carlos, SP. Vol. 39, n. 2 (2020), Art. 64pt_BR
dc.rightsOpen Accessen
dc.subjectUnicyclicen
dc.subjectNulidadept_BR
dc.subjectNull spaceen
dc.subjectNumeros combinatoriospt_BR
dc.subjectNullityen
dc.subjectSupporten
dc.subjectIndependence numberen
dc.subjectMatching numberen
dc.titleIndependence and matching numbers of unicyclic graphs from null spacept_BR
dc.typeArtigo de periódicopt_BR
dc.identifier.nrb001123140pt_BR
dc.type.originEstrangeiropt_BR


Thumbnail
   

Este item está licenciado na Creative Commons License

Mostrar registro simples