Locating eigenvalues of a symmetric matrix whose graph is unicyclic

dc.contributor.author	Braga, Rodrigo Orsini	pt_BR
dc.contributor.author	Rodrigues, Virginia Maria	pt_BR
dc.contributor.author	Silva, Rafaela Oliveira da	pt_BR
dc.date.accessioned	2021-11-25T04:36:36Z	pt_BR
dc.date.issued	2021	pt_BR
dc.identifier.issn	2676-0029	pt_BR
dc.identifier.uri	http://hdl.handle.net/10183/232154	pt_BR
dc.description.abstract	We 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.mimetype	application/pdf	pt_BR
dc.language.iso	eng	pt_BR
dc.relation.ispartof	Trends in Computational and Applied Mathematics. São Carlos, SP. Vol. 22, n. 4 (2021), p. 659 - 674	pt_BR
dc.rights	Open Access	en
dc.subject	Symmetric matrix	en
dc.subject	Matriz simétrica	pt_BR
dc.subject	Autovalores	pt_BR
dc.subject	Eigenvalue location	en
dc.subject	Grafos	pt_BR
dc.subject	Unicyclic graph	en
dc.title	Locating eigenvalues of a symmetric matrix whose graph is unicyclic	pt_BR
dc.type	Artigo de periódico	pt_BR
dc.identifier.nrb	001132344	pt_BR
dc.type.origin	Nacional	pt_BR

Este ítem está licenciado en la Creative Commons License