Open AccessThe minimum covering signless laplacian energy of graph
Author(s) -
Kavita S Permi,
H. S. Manasa,
M. C. Geetha
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1597/1/012031
Subject(s) - algorithm , artificial intelligence , computer science
Gutman [5]has come out with the idea of graph energy as summation of numerical value of latent roots of the adjacency matrix of the given graph Γ. In this paper, we introduce the Minumum Covering Signless Laplacian energy L C + E ( Γ ) of a graph Γ and obtain bounds for it. Also we find L C + E ( Γ ) of some important class of graphs.