The second least eigenvalue of the signless Laplacian of the complements of trees
| Main Authors: | Ajmal, Muhammad; School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui, 230026, P.R. China, Rehman, Masood Ur; School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui, 230026, P.R. China, Kamran, Tayyab; Department of Mathematics, Quaid-I-Azam University, Islamabad, Pakistan |
|---|---|
| Other Authors: | Chinese Scholarship Council (CSC) at USTC, China |
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2019
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/486 https://www.ejgta.org/index.php/ejgta/article/view/486/pdf_111 |
Daftar Isi:
- 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.