ScholarLens Back to search
2008•Shuxue de shijian yu renshiRequires access

On The Adjacent-Vertex-Distinguishing Total Chromatic Number and The Adjacent-Strong-Edge Chromatic Number of General Mycielski Graph of K_(m,n)

Zhang Zhong-fu

Open publisher page 0 citations

Abstract

The adjacent vertex distinguishing total chromatic numbers, and the adjacent strong edge chromatic numbers of General Mycielski of complete 2-partite graph Ml(Km,n)(l≥1,n≥m≥2) be obtained.

About this research paper

What this paper is about

The adjacent vertex distinguishing total chromatic numbers, and the adjacent strong edge chromatic numbers of General Mycielski of complete 2-partite graph Ml(Km,n)(l≥1,n≥m≥2) be obtained.

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

The adjacent vertex distinguishing total chromatic numbers, and the adjacent strong edge chromatic numbers of General Mycielski of complete 2-partite graph Ml(Km,n)(l≥1,n≥m≥2) be obtained.

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

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
On The Adjacent-Vertex-Distinguishing Total Chromatic Number and The Adjacent-Strong-Edge Chromatic Number of General Mycielski Graph of K_(m,n) — Research Paper | ScholarLens