A Note on the Adjacent Vertex Distinguishing Total Chromatic Number of Graph

Abstract:

Article Preview

A total coloring of a simple graph G is called adjacent vertex distinguishing if for any two adjacent and distinct vertices u and v in G, the set of colors assigned to the vertices and the edges incident to u differs from the set of colors assigned to the vertices and the edges incident to v. In this paper we shall prove the series-parallel graph with maximum degree 3 and the series-parallel graph whose the number of edges is the double of maximum degree minus 1 satisfy the adjacent vertex distinguishing total coloring conjecture.

Info:

Periodical:

Key Engineering Materials (Volumes 474-476)

Edited by:

Garry Zhu

Pages:

2341-2345

DOI:

10.4028/www.scientific.net/KEM.474-476.2341

Citation:

Z. W. Wang "A Note on the Adjacent Vertex Distinguishing Total Chromatic Number of Graph", Key Engineering Materials, Vols. 474-476, pp. 2341-2345, 2011

Online since:

April 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.