Mostrar el registro sencillo del ítem

dc.contributor.authorBraga, Rodrigo Orsinipt_BR
dc.contributor.authorRodrigues, Virginia Mariapt_BR
dc.contributor.authorSilva, Rafaela Oliveira dapt_BR
dc.date.accessioned2021-11-25T04:36:36Zpt_BR
dc.date.issued2021pt_BR
dc.identifier.issn2676-0029pt_BR
dc.identifier.urihttp://hdl.handle.net/10183/232154pt_BR
dc.description.abstractWe present a linear-time algorithm that computes in a given real interval the number of eigenvalues of any symmetric matrix whose underlying graph is unicyclic. The algorithm can be applied to vertex- and/or edge-weighted or unweighted unicyclic graphs. We apply the algorithm to obtain some general results on the spectrum of a generalized sun graph for certain matrix representations which include the Laplacian, normalized Laplacian and signless Laplacian matrices.en
dc.format.mimetypeapplication/pdfpt_BR
dc.language.isoengpt_BR
dc.relation.ispartofTrends in Computational and Applied Mathematics. São Carlos, SP. Vol. 22, n. 4 (2021), p. 659 - 674pt_BR
dc.rightsOpen Accessen
dc.subjectSymmetric matrixen
dc.subjectMatriz simétricapt_BR
dc.subjectAutovalorespt_BR
dc.subjectEigenvalue locationen
dc.subjectGrafospt_BR
dc.subjectUnicyclic graphen
dc.titleLocating eigenvalues of a symmetric matrix whose graph is unicyclicpt_BR
dc.typeArtigo de periódicopt_BR
dc.identifier.nrb001132344pt_BR
dc.type.originNacionalpt_BR


Ficheros en el ítem

Thumbnail
   

Este ítem está licenciado en la Creative Commons License

Mostrar el registro sencillo del ítem