Abstract
The well known concept of proper vertex colouring of a graph is used to introduce the construction of a chromatic completion graph and determining its related parameter, the chromatic completion number of a graph. The chromatic completion numbers of certain classes of cycle derivative graphs and helm graphs are then presented. Finally, we discuss further problems for research related to this concept.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
