The least eigenvalue of graphs whose complements have only two pendent vertices

Guisheng Jiang, Guidong Yu, Wei Sun and Zheng Ruan

Applied Mathematics and Computation, 2018, vol. 331, issue C, 112-119

Abstract: Let G be a simple graph and A(G) be the adjacency matrix of G. The eigenvalues of A(G) are referred to as the eigenvalues of G. In this paper, we characterize the graphs with the minimal least eigenvalue among all graphs whose complements are connected and have only two pendent vertices.

Keywords: Complement; Least eigenvalue; Pendent vertex; Adjacency matrix (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318301589
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:331:y:2018:i:c:p:112-119

DOI: 10.1016/j.amc.2018.02.048

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 ().