2017viXraOpen access

Smarandachely Adjacent-Vertex-Distinguishing Proper Edge Chromatic Number of Cm∨Kn

Shunqin Liu

Open full text 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Chromatic scale, Vertex (graph theory), Combinatorics, Mathematics, Graph

Related papers

Back to paper searchBrowse research topicsOriginal source
Smarandachely Adjacent-Vertex-Distinguishing Proper Edge Chromatic Number of Cm∨Kn — Research Paper | ScholarLens