Acessibilidade / Reportar erro

Locating Eigenvalues of a Symmetric Matrix whose Graph is Unicyclic

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 vertexand/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.

Keywords:
symmetric matrix; eigenvalue location; unicyclic graph

Sociedade Brasileira de Matemática Aplicada e Computacional - SBMAC Rua Maestro João Seppe, nº. 900, 16º. andar - Sala 163, Cep: 13561-120 - SP / São Carlos - Brasil, +55 (16) 3412-9752 - São Carlos - SP - Brazil
E-mail: sbmac@sbmac.org.br