Ma Gang
Abstract
A coloring of graph is called total coloring if adjacent or relevant elements(vertices and edges) have different colors,inwhich the required minimum number of colors is called the total chromatic number.named as χT(G).In this paper,we have given the total chromatic number of Fm∨Wn,as far as Fm∨Wn is concerned.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A coloring of graph is called total coloring if adjacent or relevant elements(vertices and edges) have different colors,inwhich the required minimum number of colors is called the total chromatic number.named as χT(G).In this paper,we have given the total chromatic number of Fm∨Wn,as far as Fm∨Wn is concerned.
Key concepts: Total coloring, Combinatorics, Chromatic scale, Fractional coloring, Brooks' theorem, Mathematics, Graph, Edge coloring