A vertex v of a given graph is said to be in a rainbow neighbourhood of G if every color class
of G consists of at least one vertex from the closed neighbourhood N [v]. A maximal proper …

The chromatic topological indices concept was introduced recently. Many other variations
concerning the chromatic topological indices have been studied lately. In this paper, we …

Graph coloring is assigning weights, integers, or colors to edges, vertices, or both in a graph
subject to certain conditions. Proper coloring C of graph G refers to assigning weights …

Graph coloring involves assignment of colors, labels, or weights to the elements of a given
graph. A color class of the graph includes a set of its vertices having the same color. A …

In this paper, the notions of rainbow neighbourhood and rainbow neighbourhood number of
a graph are generalised and further to these generalisations, the notion of a proper 𝑘-jump …

Some New Graph Coloring Problems with Applications Page 1 Some New Graph Coloring
Problems with Applications Sudev Naduvath Page 2 Outline 1 Introduction 2 Rainbow …

In this paper, we present a foundation study for proper colouring of edge-set graphs. The
authors consider that a detailed study of the colouring of edge-set graphs corresponding to …