Renyu Xu
Abstract
A vertex distinguishing total coloring is a proper total coloring using k colors that two colors sets of vertex are different.In this paper,we obtain the vertex distinguishing edge chromatic number of some split graphs K_(2n+1)\E(K_m)(n≥4,m≥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 vertex distinguishing total coloring is a proper total coloring using k colors that two colors sets of vertex are different.In this paper,we obtain the vertex distinguishing edge chromatic number of some split graphs K_(2n+1)\E(K_m)(n≥4,m≥3).
Key concepts: Total coloring, Combinatorics, Vertex (graph theory), Brooks' theorem, Fractional coloring, Complete coloring, Edge coloring, Chromatic scale