ScholarLens Back to search
2019•2019 International Conference on Electronic Engineering and Informatics (EEI)Requires access

On the Vertex-Distinguishing Equitable Edge Coloring of Product Graph

Zhuoma Ji-mao, Ma Gang

Open publisher page 0 citations

Abstract

In this paper, we derive two theorems of vertex-distinguishing equitable edge coloring of product graph by using constructive method, and present the vertex-distinguishing equitable edge chromatic numbers, which the required minimum number of colors is called the vertex-Distinguishing equitable edge chromatic number of product graphs between complete graph and complete graph, star and star, wheel and wheel, which verify the conjecture on VDEECC.

About this research paper

What this paper is about

In this paper, we derive two theorems of vertex-distinguishing equitable edge coloring of product graph by using constructive method, and present the vertex-distinguishing equitable edge chromatic numbers, which the required minimum number of colors is called the vertex-Distinguishing equitable edge chromatic number of product graphs between complete graph and complete graph, star and star, wheel and wheel, which verify the conjecture on VDEECC.

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

In this paper, we derive two theorems of vertex-distinguishing equitable edge coloring of product graph by using constructive method, and present the vertex-distinguishing equitable edge chromatic numbers, which the required minimum number of colors is called the vertex-Distinguishing equitable edge chromatic number of product graphs between complete graph and complete graph, star and star, wheel and wheel, which verify the conjecture on VDEECC.

Key concepts: Combinatorics, Edge coloring, Vertex (graph theory), Windmill graph, Graph coloring, Fractional coloring, Brooks' theorem, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
On the Vertex-Distinguishing Equitable Edge Coloring of Product Graph — Research Paper | ScholarLens