ScholarLens Back to search
2009•College MathematicsRequires access

On the Vertex-Distinguishing Edge Coloring of Join Graph with Fan and Complete Balanced Bipartite Graph

Zhang Zhong-fu

Open publisher page 0 citations

Abstract

The vertex-distinguishing edge coloring of join graph Fm∨Kn,n is studied,and the vertex-distinguishing edge chromatic numbers of join graph Fm∨Kn,n is obtained using the method of structure analysis.

About this research paper

What this paper is about

The vertex-distinguishing edge coloring of join graph Fm∨Kn,n is studied,and the vertex-distinguishing edge chromatic numbers of join graph Fm∨Kn,n is obtained using the method of structure analysis.

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 vertex-distinguishing edge coloring of join graph Fm∨Kn,n is studied,and the vertex-distinguishing edge chromatic numbers of join graph Fm∨Kn,n is obtained using the method of structure analysis.

Key concepts: Mathematics, Combinatorics, Bipartite graph, Complete bipartite graph, Windmill graph, Simplex graph, Vertex (graph theory), Edge-transitive graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
On the Vertex-Distinguishing Edge Coloring of Join Graph with Fan and Complete Balanced Bipartite Graph — Research Paper | ScholarLens