Locating eigenvalues of unbalanced unicyclic signed graphs

作者：

Highlights：

• We provide an algorithm specialized to the class of unbalanced unicyclic signed graphs.

• The algorithm computes the number of eigenvalues lying in a given real interval.

• The spectrum of bidegreed signed circular caterpillars is retrieved.

摘要

•We provide an algorithm specialized to the class of unbalanced unicyclic signed graphs.•The algorithm computes the number of eigenvalues lying in a given real interval.•The spectrum of bidegreed signed circular caterpillars is retrieved.

论文关键词：Adjacency matrix,Signature,Inertia indices,Eigenvalue localization,Integral,Circular caterpillars

论文评审过程：Received 30 October 2020, Revised 28 January 2021, Accepted 4 February 2021, Available online 19 February 2021, Version of Record 19 February 2021.

论文官网地址：https://doi.org/10.1016/j.amc.2021.126082