ScholarLens Back to search
2011•Journal of Jinggangshan UniversityRequires access

SOME PROBLEMS IN GRAPH COLORING OF JOIN GRAPH WITH WHEEL AND COMPLETE BALANCED BIPARTITE GRAPH

Zhang Zhong-fu

Open publisher page 0 citations

Abstract

Graph coloring is an important branch of graph theory.In this paper,we obtain the total chromatic number,equitable total chromatic number and adjacent vertex distinguishing edge chromatic number of the join graph of wheel and complete balanced bipartite graph using analytic methods.

About this research paper

What this paper is about

Graph coloring is an important branch of graph theory.In this paper,we obtain the total chromatic number,equitable total chromatic number and adjacent vertex distinguishing edge chromatic number of the join graph of wheel and complete balanced bipartite graph using analytic methods.

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

Graph coloring is an important branch of graph theory.In this paper,we obtain the total chromatic number,equitable total chromatic number and adjacent vertex distinguishing edge chromatic number of the join graph of wheel and complete balanced bipartite graph using analytic methods.

Key concepts: Combinatorics, Simplex graph, Windmill graph, Foster graph, Graph power, Butterfly graph, Voltage graph, Bipartite graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
SOME PROBLEMS IN GRAPH COLORING OF JOIN GRAPH WITH WHEEL AND COMPLETE BALANCED BIPARTITE GRAPH — Research Paper | ScholarLens