2005Journal of Lanzhou UniversityRequires access

Adjacent vertex-distinguishing edge chromatic number of Cm V Kn

Zhang Zhong-fu

Open publisher page 1 citations

Abstract

The adjacent vertex-distinguishing edge chromatic number of join graph of circle and complete graph is obtained in this paper.

About this research paper

What this paper is about

The adjacent vertex-distinguishing edge chromatic number of join graph of circle and complete graph is obtained in this paper.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

The adjacent vertex-distinguishing edge chromatic number of join graph of circle and complete graph is obtained in this paper.

Key concepts: Vertex (graph theory), Chromatic scale, Mathematics, Combinatorics, Enhanced Data Rates for GSM Evolution, Physics, Graph, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Adjacent vertex-distinguishing edge chromatic number of Cm V Kn — Research Paper | ScholarLens