摘要：The color energy of a graph is defined as sumof absolute color eigenvalues of graph, denoted by Ec(G). LetGc = (V, E) be a color graph and P = {V1, V2, . . . , Vk} be apartition of V of order k ≥ 1. The k -color complement {Gc}Pkof Gc is defined as follows: For all Vi and Vj in P, i = j, removethe edges between Vi and Vj and add the edges which are not inGc such that end vertices have different colors. For each set Vrin the partition P, remove the edges of Gc inside Vr, and addthe edges of Gc (the complement of Gc ) joining the vertices ofVr. The graph {Gc}Pk(i)thus obtained is called the k(i)⇒ colorcomplement of Gc with respect to the partition P of V . Inthis paper, we compute color Laplacian energy of generalisedcomplements of few standard graphs. Color Laplacian energydepends on assignment of colors to the vertices and the partitionof V (G).
关键词：k∥color complement; k(i)⇒color complement; color Laplacian energy; color Laplacian spectrum
