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:
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 01988 am a22002653u 4500
001 EJGTA_486_pdf_111
042 |a dc 
100 1 0 |a Ajmal, Muhammad; School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui, 230026, P.R. China  |e author 
100 1 0 |a Chinese Scholarship Council   |q  (CSC)   |e contributor 
700 1 0 |a Rehman, Masood Ur; School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui, 230026, P.R. China  |e author 
700 1 0 |a Kamran, Tayyab; Department of Mathematics, Quaid-  |e author 
245 0 0 |a The second least eigenvalue of the signless Laplacian of the complements of trees 
260 |b GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,   |c 2019-10-10. 
500 |a https://www.ejgta.org/index.php/ejgta/article/view/486 
520 |a 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 unique graph with 2nd LESL in Tnc ∖ {K1, n − 1c}, where K1, n − 1c represents the complement of star of order n. 
540 |a Copyright (c) 2019 Electronic Journal of Graph Theory and Applications (EJGTA) 
546 |a eng 
690 |a eigenvalue, tree, signless Laplacian matrix 
655 7 |a info:eu-repo/semantics/article  |2 local 
655 7 |a info:eu-repo/semantics/publishedVersion  |2 local 
655 7 |a Peer-reviewed Article  |2 local 
786 0 |n Electronic Journal of Graph Theory and Applications (EJGTA); Vol 7, No 2 (2019): Electronic Journal of Graph Theory and Applications; 265 - 275 
786 0 |n 2338-2287 
787 0 |n https://www.ejgta.org/index.php/ejgta/article/view/486/pdf_111 
856 4 1 |u https://www.ejgta.org/index.php/ejgta/article/view/486/pdf_111  |z Get Fulltext