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.
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Digital revista |
| Language: | English |
| Published: |
Sociedade Brasileira de Matemática Aplicada e Computacional - SBMAC
2021
|
| Online Access: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S2676-00292021000400659 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|