The second least eigenvalue of the signless Laplacian of the complements of trees

The second least eigenvalue of the signless Laplacian of the complements of trees

Suppose that Tnc is a set, such that the elements of Tnc are the complements of trees of order n. In 2012, Li and Wang gave the unique graph in the set Tnc ∖ {K1, n − 1c} with minimum 1st 'least eigenvalue of the signless Laplacian' (abbreviated to a LESL). In the present work, we give the...

Full description

Saved in:
Bibliographic Details
Main Authors: Ajmal, Muhammad; School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui, 230026, P.R. China (Author), Rehman, Masood Ur; School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui, 230026, P.R. China (Author), Kamran, Tayyab; Department of Mathematics, Quaid- (Author)
Other Authors: Chinese Scholarship Council (CSC) (Contributor)
Format: EJournal Article
Published: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2019-10-10.
Subjects:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

Get Fulltext

3rd Floor Main Library

Holdings details from 3rd Floor Main Library
Call Number: A1234.567
Copy 1 Available

Similar Items