A proper total coloring distinguishing adjacent vertices by sums of some
product graphs
release_eu325h7l6ze5hjvefxmycjqm5e
by
Hana Choi, Dongseok Kim, Sungjin Lee, Yeonhee Lee
2014
Abstract
In this article, we consider a proper total coloring distinguishes adjacent
vertices by sums, if every two adjacent vertices have different total sum of
colors of the edges incident to the vertex and the color of the vertex.
Pilsniak and Wozniak PW first introduced this coloring and made a
conjecture that the minimal number of colors need to have a proper total
coloring distinguishes adjacent vertices by sums is less than or equal to the
maximum degree plus 3. We study proper total colorings distinguishing
adjacent vertices by sums of some graphs and their products. We find that these
graphs satisfy the conjecture.
In text/plain
format
Archived Files and Locations
application/pdf 216.4 kB
file_tiazqyyehjel5j4ou62nergrg4
|
arxiv.org (repository) web.archive.org (webarchive) |
1402.0615v2
access all versions, variants, and formats of this works (eg, pre-prints)