Fractional Coloring of Some Products of Simple Graphs

Abstract

Graph coloring is a component of graph labeling in graph theory; it is the assignment of labels generally referred to as "colors" to elements of a graph subject to specified constraints. In this article, we will almost certainly look at fractional colorings of graphs in which the amount of color assigned to a vertex is determined by local characteristics such as its degree or the clique number of its neighborhood. The fractional chromatic number of a graph is inferior to all rational numbers a/b such that there exists a proper a/b-coloring of G. In this article, we studied fractional coloring in graph theory for many types of graphs such as path graph, cycle graph, complete graph and tree related graphs.