Paper Title:
Vertex-Distinguishing Total Coloring of Ladder Graphs (N=0(mod 8) )
  Abstract

A proper total coloring of a simple graph G is called vertex distinguishing if for any two distinct vertices u and v in G, the set of colors assigned to the elements incident to u differs from the set of colors incident to v. The minimal number of colors required for a vertex distinguishing total coloring of G is called the vertex distinguishing total coloring chromatic number. In a paper, we give a “triangle compositor”, by the compositor, we proved that when n=0(mod 8) and , vertex distinguishing total chromatic number of “ladder graphs” is n.

  Info
Periodical
Advanced Materials Research (Volumes 225-226)
Edited by
Helen Zhang, Gang Shen and David Jin
Pages
243-246
DOI
10.4028/www.scientific.net/AMR.225-226.243
Citation
Z. W. Wang, "Vertex-Distinguishing Total Coloring of Ladder Graphs (N=0(mod 8) )", Advanced Materials Research, Vols. 225-226, pp. 243-246, 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: Zhi Wen Wang
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...
2341
Authors: Chao Yang, Bing Yao, Hong Yu Wang, Xiang'en Chen, Si Hua Yang
Chapter 5: Computing Methods and Algorithms, Automation and Information Technologies, CAD Applications
Abstract:Building up graph models to simulate scale-free networks is an important method since graphs have been used in researching scale-free...
2199
Authors: Mu Chun Li, Shuang Li Wang, Li Li Wang
Chapter 3: Images, Sound and Other Multimedia Technologies
Abstract:Using the analysis method and the function of constructing the Smarandachely adjacent vertex distinguishing E-total coloring function, the...
379