Affiliation:
1. Department of Mathematics, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R. China
Abstract
A [Formula: see text]-distance vertex-distinguishing total coloring of a graph [Formula: see text] is a proper total coloring of [Formula: see text] such that any pair of vertices at distance [Formula: see text] have distinct sets of colors. The [Formula: see text]-distance vertex-distinguishing total chromatic number [Formula: see text] of [Formula: see text] is the minimum number of colors needed for a [Formula: see text]-distance vertex-distinguishing total coloring of [Formula: see text]. In this paper, we determine the [Formula: see text]-distance vertex-distinguishing total chromatic number of some graphs such as paths, cycles, wheels, trees, unicycle graphs, [Formula: see text], and [Formula: see text]. We conjecture that every simple graph [Formula: see text] with maximum degree [Formula: see text] satisfies [Formula: see text].
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Two-distance vertex-distinguishing total coloring of subcubic graphs;Proceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science;2023-06-28
2. On $$d_2$$-Coloring of Certain Families of Graphs;Fuzzy Mathematical Analysis and Advances in Computational Mathematics;2022
3. A scale space model of weighted average CNN ensemble for ASL fingerspelling recognition;INT J COMPUT SCI ENG;2020