2013•Journal of Shangluo UniversityRequires access

Total Coloring And Star Total Coloring of Spider Graph

Zhang Dong-ha

Abstract

Spider graph is an important network topology, whose coloring plays an important role in guiding for the assignment of the network. Total coloring and star total coloring of spider graph are discussed by the exhaustion method and the combination analytic method, In this way, the total chromatic number and the star total chromatic number of the spider graph are gained,it enriches the content of graph coloring.

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: Fractional coloring, List coloring, Complete coloring, Edge coloring, Total coloring, Graph coloring, Combinatorics, Windmill graph