ScholarLens Back to search
2015•Journal of Lanzhou University of TechnologyRequires access

Adjacent vertex distinguishing total coloring of spider web graph

Zhang Dong-ha

Open publisher page 0 citations

Abstract

The adjacent vertex distinguishing total coloring of spider web graph is studied by means of exhaustion method and combination analysis method.The results show that the adjacent vertex distinguishing total chromatic number of spider web graph exists.

About this research paper

What this paper is about

The adjacent vertex distinguishing total coloring of spider web graph is studied by means of exhaustion method and combination analysis method.The results show that the adjacent vertex distinguishing total chromatic number of spider web graph exists.

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 adjacent vertex distinguishing total coloring of spider web graph is studied by means of exhaustion method and combination analysis method.The results show that the adjacent vertex distinguishing total chromatic number of spider web graph exists.

Key concepts: Spider, Combinatorics, Fractional coloring, Complete coloring, List coloring, Vertex (graph theory), Windmill graph, Total coloring

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Adjacent vertex distinguishing total coloring of spider web graph — Research Paper | ScholarLens