![](/images/graphics-bg.png)
General Vertex-Distinguishing Total Coloring of Graphs
Joint Authors
Source
Journal of Applied Mathematics
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-08-03
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Liu, Chanjuan& Zhu, Enqiang. 2014. General Vertex-Distinguishing Total Coloring of Graphs. Journal of Applied Mathematics،Vol. 2014, no. 2014, pp.1-7.
https://search.emarefa.net/detail/BIM-503161
Modern Language Association (MLA)
Liu, Chanjuan& Zhu, Enqiang. General Vertex-Distinguishing Total Coloring of Graphs. Journal of Applied Mathematics No. 2014 (2014), pp.1-7.
https://search.emarefa.net/detail/BIM-503161
American Medical Association (AMA)
Liu, Chanjuan& Zhu, Enqiang. General Vertex-Distinguishing Total Coloring of Graphs. Journal of Applied Mathematics. 2014. Vol. 2014, no. 2014, pp.1-7.
https://search.emarefa.net/detail/BIM-503161
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-503161