Fugang Chao
Abstract
A proper total coloring of the graph G is called adjacent vertex distinguishing total coloring,if any two adjacent vertices have different color sets.In this paper,an upper bound on the adjacent vertex distinguishing total chromatic number was obtained using the probability methods.
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 proper total coloring of the graph G is called adjacent vertex distinguishing total coloring,if any two adjacent vertices have different color sets.In this paper,an upper bound on the adjacent vertex distinguishing total chromatic number was obtained using the probability methods.
Key concepts: Mathematics, Combinatorics, Chromatic scale, Vertex (graph theory), Fractional coloring, Upper and lower bounds, Brooks' theorem, Total coloring