TY - JOUR

T1 - Color Energy of Generalised Complements of a Graph

AU - Nayak, Swati

AU - D’Souza, Sabitha

AU - Gowtham, H. J.

AU - Bhat, Pradeep G.

N1 - Publisher Copyright:
© 2020, IAENG International Journal of Applied Mathematics. All Rights Reserved
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.

PY - 2020

Y1 - 2020

N2 - The color energy of a graph is defined as sum of absolute color eigenvalues of graph, denoted by EC(G). Let Gc = (V, E) be a color graph and P = {V1, V2,…,Vk} be a partition of V of order k≥1. The k-color complement {Gc}k p of Gc is defined as follows: For all Vi and Vj in P, i ≠ j, remove the edges between Vi and Vj and add the edges which are not in Gc such that end vertices have different colors. For each set Vr in the partition P, remove the edges of Gc inside Vr, and add the edges of Gc (the complement of Gc) joining the vertices of Vr. The graph {Gc}P k(i) thus obtained is called the k(i)— color complement of Gc with respect to the partition P of V. In this paper we characterize generalized color complements of some graphs. We also compute color energy of generalised complements of star, complete, complete bipartite, crown, cocktail party, double star and friendship graphs.

AB - The color energy of a graph is defined as sum of absolute color eigenvalues of graph, denoted by EC(G). Let Gc = (V, E) be a color graph and P = {V1, V2,…,Vk} be a partition of V of order k≥1. The k-color complement {Gc}k p of Gc is defined as follows: For all Vi and Vj in P, i ≠ j, remove the edges between Vi and Vj and add the edges which are not in Gc such that end vertices have different colors. For each set Vr in the partition P, remove the edges of Gc inside Vr, and add the edges of Gc (the complement of Gc) joining the vertices of Vr. The graph {Gc}P k(i) thus obtained is called the k(i)— color complement of Gc with respect to the partition P of V. In this paper we characterize generalized color complements of some graphs. We also compute color energy of generalised complements of star, complete, complete bipartite, crown, cocktail party, double star and friendship graphs.

UR - http://www.scopus.com/inward/record.url?scp=85098231901&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85098231901&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85098231901

SN - 1992-9978

VL - 50

JO - IAENG International Journal of Applied Mathematics

JF - IAENG International Journal of Applied Mathematics

IS - 4

ER -