Adjacent Vertex-distinguishing V-total Coloring of Several Categories of Corona Graphs
LU Yong-hon
Abstract
LU Yong-hon
Abstract
In this paper,the adjacent vertex-distinguishing V-total coloring of C_m ? P_n and P_m ·C_n are obtained by constructing coloring function.Through the adjacent vertexdistinguishing V-total coloring of P_m ? C_n,we skilfully get the adjacent vertex-distinguishing V-total coloring of C_m·C_n,and obtain the adjacent vertex-distinguishing V-total chromatic number of those graphs.Further,the conjecture of adjacent vertex-distinguishing V-total coloring of graphs is checked.
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.
In this paper,the adjacent vertex-distinguishing V-total coloring of C_m ? P_n and P_m ·C_n are obtained by constructing coloring function.Through the adjacent vertexdistinguishing V-total coloring of P_m ? C_n,we skilfully get the adjacent vertex-distinguishing V-total coloring of C_m·C_n,and obtain the adjacent vertex-distinguishing V-total chromatic number of those graphs.Further,the conjecture of adjacent vertex-distinguishing V-total coloring of graphs is checked.
Key concepts: Total coloring, Combinatorics, Fractional coloring, Vertex (graph theory), Complete coloring, Brooks' theorem, Mathematics, Conjecture