Analytic Approach to Study Rainbow Coloring of Graphs

Abstract

Numerous fields depend heavily on mathematics, and in this one, graph theory stands out as an important field with a long history in mathematics. Graph Theory has a long and rich history. For more than two centuries, it has provided a multitude of avenues of study and will do so for many more to come. Many existing real-world problems can be successfully analysed by using Graphs. Many problems in physics, chemistry, communication science, computer technology, genetics, psychology, and linguistics can be formulated as problems in graph theory. Also, several branches of mathematics have close connections with graph theory, such as: group theory, matrix theory, and probability. newlineGraph coloring is a fundamental concept in graph theory where colors are assigned to the vertices or edges of a graph in such a way that no two adjacent vertices (or edges) share the same color. The objective is to minimize the number of colors used while ensuring this constraint is satisfied. Graph coloring has numerous applications in various fields, including scheduling problems, register allocation in compilers, and map labeling. newlineRainbow coloring, a special case of graph coloring, introduces additional constraints where each edge (or vertex) is assigned a distinct color, forming a quotrainbowquot effect in the graph. This concept is particularly relevant in scenarios where distinctiveness between edges or vertices is crucial, such as in network communication, where different channels need to be distinguished, or in scheduling problems where each task must be executed using unique resources. newlineIn this synopsis, and later in the thesis, the graphs considered are simple, finite, undirected, and connected. Let and#119866;=(and#119881;,and#119864;) denote a graph with a vertex set and#119881; and an edge set and#119864;. Our primary focus lies on the rainbow edge and vertex connection numbers of certain graphs.

Description

Keywords

Citation

item.page.endorsement

item.page.review

item.page.supplemented

item.page.referenced