The least signless Laplacian eignvalue of the complements of unicyclic graphs

Gui-Dong Yu, Yi-Zheng Fan and Miao-Lin Ye

Applied Mathematics and Computation, 2017, vol. 306, issue C, 13-21

Abstract: Let Snc be the set of all connected graph each of which is a complement of an n-vertex unicyclic graph. Li and Wang (2012) determined the graphs with the least signless Laplacian eignvalue among all the graphs of the complements of n-vertex trees. In this paper, as a continuance of it, the unique graph among Snc which minimizes the least signless Laplacian eigenvalue is identified.

Keywords: Unicyclic graph; Complement; Signless Laplacian matrix; The least signless Laplacian eigenvalue (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317301224
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:306:y:2017:i:c:p:13-21

DOI: 10.1016/j.amc.2017.02.018

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