General vertex-distinguishing total coloring of graphs (Q2336778)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7131921
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | General vertex-distinguishing total coloring of graphs |
scientific article; zbMATH DE number 7131921 |
Statements
General vertex-distinguishing total coloring of graphs (English)
0 references
19 November 2019
0 references
Summary: 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.
0 references
0 references
0 references
0.9048453569412231
0 references
0.8890290856361389
0 references
0.8827630281448364
0 references
0.8776683211326599
0 references
