Coloring in graphs of twist knots
Abdulgani Şahi̇n · Numerical Methods for Partial Differential Equations · 2020
Abstract Let Tn be a twist knot with n half‐twists and Gn be the graph of Tn. The closed neighborhood N[v] of a vertex v in Gn, which included at least one colored vertex for each color in a proper n‐coloring of Gn, is called a rainbow neighborhood. There are different types of graph coloring in the literature. We consider some of these types in here. In this paper, we determine the chromatic number of graphs of twist knots and study rainbow neighborhood of graphs of twist knots. We determine the rainbow neighborhood number and the fading number of them. Furthermore, we determine coupon coloring and the coupon coloring number of graphs of twist knots.