Neighbor sum distinguishing total choice number of IC-planar graphs with restrictive conditions
A neighbor sum distinguishing (NSD) total coloring $ \phi $ of $ G $ is a proper total coloring such that $ \sum_{z\in E_{G}(u)\cup\{u\}}\phi(z)\neq\sum_{z\in E_{G}(v)\cup\{v\}}\phi(z) $ for each edge $ uv\in E(G) $. Pilśniak and Woźniak asserted that each graph with a maximum degree $ \Delta $ admi...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2023-04-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2023692?viewType=HTML |