2013Unpublished venueRequires access

On the Adjacent Vertex Strong Distinguishing Total Chromatic Number of Some Graphs

Qiantai Yan, LI Wu-zhuang

Open publisher page 1 citations

Abstract

In this paper, the adjacent vertex strong distinguishing total chromatic number of the wheel graph Wn, the fan graph Fn, the windmill graph K3, the gear wheel graph Wn, the graph Dm, 4 and graph Dm, n are given.

About this research paper

What this paper is about

In this paper, the adjacent vertex strong distinguishing total chromatic number of the wheel graph Wn, the fan graph Fn, the windmill graph K3, the gear wheel graph Wn, the graph Dm, 4 and graph Dm, n are given.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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, the adjacent vertex strong distinguishing total chromatic number of the wheel graph Wn, the fan graph Fn, the windmill graph K3, the gear wheel graph Wn, the graph Dm, 4 and graph Dm, n are given.

Key concepts: Windmill graph, Wheel graph, Combinatorics, Butterfly graph, Graph, Friendship graph, Mathematics, Chromatic scale

Related papers

Back to paper searchBrowse research topicsOriginal source
On the Adjacent Vertex Strong Distinguishing Total Chromatic Number of Some Graphs — Research Paper | ScholarLens