Smarandachely Adjacent-Vertex-Distinguishing Proper Edge Chromatic Number of Cm∨Kn
Shunqin Liu
Abstract
Shunqin Liu
Abstract
According to different conditions, researchers have defined a great deal of coloring problems and the corresponding chromatic numbers. Such as, adjacent-vertex-distinguishing total chromatic number, adjacent-vertex-distinguishing proper edge chromatic number, smarandachely-adjacent-vertex-distinguishing proper edge chromatic number, smarandachely-adjacent-vertex-distinguishing proper total chromatic number. And we focus on the smarandachely adjacent-vertex-distinguishing proper edge chromatic number in this paper, study the smarandachely adjacent-vertex-distinguishing proper edge chromatic number of joint graph Cm∨Kn.
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.
According to different conditions, researchers have defined a great deal of coloring problems and the corresponding chromatic numbers. Such as, adjacent-vertex-distinguishing total chromatic number, adjacent-vertex-distinguishing proper edge chromatic number, smarandachely-adjacent-vertex-distinguishing proper edge chromatic number, smarandachely-adjacent-vertex-distinguishing proper total chromatic number. And we focus on the smarandachely adjacent-vertex-distinguishing proper edge chromatic number in this paper, study the smarandachely adjacent-vertex-distinguishing proper edge chromatic number of joint graph Cm∨Kn.
Key concepts: Chromatic scale, Vertex (graph theory), Combinatorics, Mathematics, Graph