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

<p>Suppose that <span class="math">T<sub><em>n</em></sub><sup><em>c</em></sup></span> is a set, such that the elements of <span class="math">T<sub><em>n</em></sub><sup><em>...

Full description

Bibliographic Details
Main Authors: Muhammad Ajmal, Masood Ur Rehman, Tayyab Kamran
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2019-10-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
eigenvalue, tree, signless laplacian matrix
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/486

Internet

https://www.ejgta.org/index.php/ejgta/article/view/486

Similar Items