In this paper, we introduce the new concept of color Signless Laplacian energy LEc+(G). It depends on the underlying graph G and the colors of the vertices. Moreover, we compute color signless Laplacian spectrum and the color signless Laplacian energy of families of graph with the minimum number of colors. The color signless Laplacian energy for the complement of some colored graphs is also obtained.
|Number of pages||7|
|Journal||AKCE International Journal of Graphs and Combinatorics|
|Publication status||Published - 01-08-2017|
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics