Abstract
AbstractGraph colouring is a prime element in graph theory with tremendous applicability in computer science like data mining, clustering, networking, image segmentation, etc., and variety of implementations in aircraft scheduling, register allocation, sudoku, mobile networking, etc. This paper defines the perfect colouring of graphs and gives the relation between perfect colouring and vertex colouring for snake graph family. If Sn is a snake graph, then \(\chi \left( {S_{n} } \right) + 2 \le \chi^{P} \left( {S_{n} } \right) \le \chi \left( {S_{n} } \right) + 6\).KeywordsPerfect colouringChromatic numberSnake graph
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
