Jiandong He
Abstract
A new graph of P2n was defined,the adjacent strong edge chromatic number and adjacent vertex distinguishing total chromatic number,and construct the coloring method of adjacent vertex distinguishing total coloring of the graph of Mycielski of graph P2n also be confirmed when n≥3.
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 new graph of P2n was defined,the adjacent strong edge chromatic number and adjacent vertex distinguishing total chromatic number,and construct the coloring method of adjacent vertex distinguishing total coloring of the graph of Mycielski of graph P2n also be confirmed when n≥3.
Key concepts: Combinatorics, Edge coloring, Vertex (graph theory), Graph, Mathematics, Fractional coloring, Brooks' theorem, Graph coloring