Abstract
Let P(G,�) be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any graph H, P(H,�) = P(G,�) implies H is isomorphic to G. In this paper, we determine the chro- maticity of all Turan graphs with at most three edges deleted. As a by product, we found many families of chromatically unique graphs and chromatic equivalence classes of graphs.
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 callMore From: Iranian Journal of Mathematical Sciences and Informatics
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.
