Studies on color energy and its variations in graphs

Studies on color energy and its variations in graphs

Mathematics

This thesis consists of studies on color energy and its variations in graphs. Apart from the exploration of color energy corresponding to various coloring schemes, the notion of P-energy as a generalization of color energy has been introduced. The computation of color energy and P-energy of graphs has been carried out using Python programs, while the general results are derived using research methods and proof techniques in linear algebra. The bounds of color energy for a graph G have been established in terms of several graph parameters such as chromatic number χ(G), domination number γ(G), maximum degree ∆(G) etc. It has been found out that the color energy of a graph G is greater than or equal to 1 n γ(G) p 2(m+m′ c ). Further, the bounds of color energy of a graph G in terms of extreme eigenvalues of color matrix of G have been obtained.

Joshi, Prajakta Bharat - 1740089

CHRIST (Deemed to be University)

English

PhD