Paper Title:
A Note on the Adjacent Vertex Distinguishing Total Chromatic Number of Graph
  Abstract

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
$32.00
Share

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

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

Authors: Zong Jian Sun, Jing Chen
Chapter 5: Communication and Signal Processing
Abstract:The adjacent strong edge chromatic number of graphs can be applied to the optimization design of wireless sensor network to make the network...
474
Authors: Shuang Liang Tian, Qian Wang
Chapter 3: Numerical Methods, Computation Methods and Algorithms for Modeling, Simulation and Optimization, Data Mining and Data Processing
Abstract:A-distance coloringof is said to be adjacent vertex distinguishing if this coloring satisfy for any pair of adjacent vertices and in,...
2416