Skip to Content
SymmetrySymmetry
  • Article
  • Open Access

26 September 2021

13 Pages

On the Total Neighbor Sum Distinguishing Index of IC-Planar Graphs

,
and
School of Mathematics and Computer Application, Shangluo University, Shangluo 726000, China
*
Author to whom correspondence should be addressed.
This article belongs to the Special Issue Research on Symmetry Applied in Graph Theory

Abstract

A proper total k-coloring ϕ of G with ∑z∈EG(u)∪{u}ϕ(z)≠∑z∈EG(v)∪{v}ϕ(z) for each uv∈E(G) is called a total neighbor sum distinguishing k-coloring, where EG(u)={uv|uv∈E(G)}. Pilśniak and Woźniak conjectured that every graph with maximum degree Δ exists a total neighbor sum distinguishing (Δ+3)-coloring. In this paper, we proved that any IC-planar graph with Δ≥12 satisfies this conjecture, which improves the result of Song and Xu.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.