Unbalanced signed bicyclic graphs minimizing the least eigenvalue

Zhaolin Teng, Dan Li, Yuanyuan Chen and Jixiang Meng

Applied Mathematics and Computation, 2024, vol. 466, issue C

Abstract: Given a signed graph G˙, let A(G˙) denote its adjacency matrix. The eigenvalues of A(G˙) are called the eigenvalues of G˙. In this study we focus on the least eigenvalues of connected signed graphs, and consider the behavior of the least eigenvalue of a signed graph when it is perturbed by some edge variations. In particular, we identify the first four smallest eigenvalues with their extremal signed graphs among all the unbalanced signed bicyclic graphs of order n≥31 and range them corresponding to their least eigenvalues in an increasing order.

Keywords: Connected signed graph; The least eigenvalue; Unbalanced signed bicyclic graph (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323006471
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:466:y:2024:i:c:s0096300323006471

DOI: 10.1016/j.amc.2023.128478

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().