Abstract
Coloring is a fundamental problem in scientific computation and engineering design. In recent years, a variety of colorings frequently appeared and solved many problems in production. For example, adjacent-vertex-distinguishing proper total coloring, adjacent-vertex-distinguishing proper edge coloring, smarandachely-adjacent-vertex-distinguishing proper edge coloring. It is an important also difficult problem to discuss the coloring numbers of a given graph class. And we focus on the adjacent-vertex-distinguishing proper total coloring numbers in this paper. We study the adjacent-vertex-distinguishing proper total coloring numbers of joint graphs
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IOP Conference Series: Earth and Environmental Science
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.