Abstract
The concept of critical injective chromatic graph is introduced. Some properties of critical injective chromatic graph are studied based on number of vertices and degree of graphs. The condition for cycles to be critical injective chromatic is obtained. The existence of a critical injective chromatic graph is established. An algorithm for injective colouring of vertices of a given connected graph is proposed. An application of injective chromatic number and injective chromatic sum in the diagnosis of diseases based on symptoms is suggested.
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: International Journal of Computing Science and Mathematics
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.
