General Vertex-Distinguishing Total Coloring of Graphs

General Vertex-Distinguishing Total Coloring of Graphs

The general vertex-distinguishing total chromatic number of a graph G is the minimum integer k, for which the vertices and edges of G are colored using k colors such that any two vertices have distinct sets of colors of them and their incident edges. In this paper, we figure out the exact value of t...

Full description

Bibliographic Details
Main Authors: Chanjuan Liu, Enqiang Zhu
Format: Article
Language:English
Published: Hindawi Limited 2014-01-01
Series:Journal of Applied Mathematics
Online Access:http://dx.doi.org/10.1155/2014/849748
id doaj-11e7b1f312c044898c5a187b177ac393
record_format Article
spelling doaj-11e7b1f312c044898c5a187b177ac3932020-11-25T00:47:51ZengHindawi LimitedJournal of Applied Mathematics1110-757X1687-00422014-01-01201410.1155/2014/849748849748General Vertex-Distinguishing Total Coloring of GraphsChanjuan Liu0Enqiang Zhu1School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, ChinaSchool of Electronics Engineering and Computer Science, Peking University, Beijing 100871, ChinaThe general vertex-distinguishing total chromatic number of a graph G is the minimum integer k, for which the vertices and edges of G are colored using k colors such that any two vertices have distinct sets of colors of them and their incident edges. In this paper, we figure out the exact value of this chromatic number of some special graphs and propose a conjecture on the upper bound of this chromatic number.http://dx.doi.org/10.1155/2014/849748
collection DOAJ
language English
format Article
sources DOAJ
author Chanjuan Liu
Enqiang Zhu
spellingShingle Chanjuan Liu
Enqiang Zhu
General Vertex-Distinguishing Total Coloring of Graphs
Journal of Applied Mathematics
author_facet Chanjuan Liu
Enqiang Zhu
author_sort Chanjuan Liu
title General Vertex-Distinguishing Total Coloring of Graphs
title_short General Vertex-Distinguishing Total Coloring of Graphs
title_full General Vertex-Distinguishing Total Coloring of Graphs
title_fullStr General Vertex-Distinguishing Total Coloring of Graphs
title_full_unstemmed General Vertex-Distinguishing Total Coloring of Graphs
title_sort general vertex-distinguishing total coloring of graphs
publisher Hindawi Limited
series Journal of Applied Mathematics
issn 1110-757X
1687-0042
publishDate 2014-01-01
description The general vertex-distinguishing total chromatic number of a graph G is the minimum integer k, for which the vertices and edges of G are colored using k colors such that any two vertices have distinct sets of colors of them and their incident edges. In this paper, we figure out the exact value of this chromatic number of some special graphs and propose a conjecture on the upper bound of this chromatic number.
url http://dx.doi.org/10.1155/2014/849748
work_keys_str_mv AT chanjuanliu generalvertexdistinguishingtotalcoloringofgraphs
AT enqiangzhu generalvertexdistinguishingtotalcoloringofgraphs
_version_ 1725258261447311360

Similar Items