2014•Journal of Gansu SciencesRequires access

(D)3-Vertex Distinguishing Edge Coloring of Spider Graph

Zhang Dong-ha

Abstract

The spider graph is an important network topology,whose coloring plays an important role in guiding the allocation of the network weight.(D)3-vertex distinguishing edge coloring of the spider graph is discussed by the exhaustion method and the combination analytic method and the(D)3-vertex distinguishing edge chromatic number of the spider graph is obtained.

About this research paper

What this paper is about

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

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