On Quipus whose signless Laplacian index does not exceed 4.5

2022 ◽  
Author(s):  
Francesco Belardo ◽  
Maurizio Brunetti ◽  
Vilmar Trevisan ◽  
Jianfeng Wang
Keyword(s):  
Signless Laplacian

scholarly journals The minimum covering signless laplacian energy of graph

2020 ◽  
Vol 1597 ◽  
pp. 012031
Author(s):  
Kavita Permi ◽  
H S Manasa ◽  
M C Geetha
Keyword(s):  
Laplacian Energy ◽  
Signless Laplacian ◽  
Energy Of Graph

scholarly journals On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 512
Author(s):  
Maryam Baghipur ◽  
Modjtaba Ghorbani ◽  
Hilal A. Ganie ◽  
Yilun Shang
Keyword(s):  
Lower Bounds ◽  
Complete Graph ◽  
Distance Matrix ◽  
Upper And Lower Bounds ◽  
Laplacian Eigenvalue ◽  
Signless Laplacian ◽  
Graph Parameters ◽  
Simple Connected Graph ◽  
Second Largest Eigenvalue ◽  
Reciprocal Distance Matrix

The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the total reciprocal distance vertices. In the present work, some upper and lower bounds for the second-largest eigenvalue of the signless Laplacian reciprocal distance matrix of graphs in terms of various graph parameters are investigated. Besides, all graphs attaining these new bounds are characterized. Additionally, it is inferred that among all connected graphs with n vertices, the complete graph Kn and the graph Kn−e obtained from Kn by deleting an edge e have the maximum second-largest signless Laplacian reciprocal distance eigenvalue.

scholarly journals Color signless Laplacian energy of graphs

2017 ◽  
Vol 14 (2) ◽  
pp. 142-148 ◽  
Author(s):  
Pradeep G. Bhat ◽  
Sabitha D’Souza
Keyword(s):  
Laplacian Energy ◽  
Signless Laplacian

Graphs with the second signless Laplacian eigenvalue ≤ 4

2021 ◽  
Vol 10 (1) ◽  
pp. 131-152
Author(s):  
Stephen Drury
Keyword(s):  
General Solution ◽  
Knapsack Problem ◽  
Laplacian Eigenvalue ◽  
Simple Graphs ◽  
Largest Eigenvalue ◽  
Signless Laplacian ◽  
Second Largest Eigenvalue

Abstract We discuss the question of classifying the connected simple graphs H for which the second largest eigenvalue of the signless Laplacian Q(H) is ≤ 4. We discover that the question is inextricable linked to a knapsack problem with infinitely many allowed weights. We take the first few steps towards the general solution. We prove that this class of graphs is minor closed.

Sign in / Sign up

Export Citation Format

Share Document