Open AccessMinimum dominating signless laplacian graph energy
Author(s) -
Kavita S Permi
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/012044
Subject(s) - graph , algorithm , computer science , mathematics , combinatorics
Minimum dominating graph energy was proposed by Rajesh Kanna et al.[11] in 2013. I propose the Minumum dominating signless laplacian graph energy L D + E ( Γ ) in this paper. Also obtain some bounds and discuss some important graph classes for the minimum dominating signless Laplacian energy.