Abstract
AbstractLet 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Numerical Methods for Partial Differential Equations
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
