We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Color Energy of Generalised Complements of a Graph.
- Authors
Nayak, Swati; D'Souza, Sabitha; H. J., Gowtham; Bhat, Pradeep G.
- Abstract
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}kP 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}Pk(iP) 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.
- Subjects
GRAPH coloring; BINARY stars; COLORS; COCKTAIL parties
- Publication
IAENG International Journal of Applied Mathematics, 2020, Vol 50, Issue 4, p720
- ISSN
1992-9978
- Publication type
Article