Abstract
Let P(G, λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G ∼ H ,i f P(G, λ )= P(H, λ). We write [G ]= {H|H ∼ G} .I f [G ]= {G}, then G is said to be chromatically unique. In this paper, two new families of chromatically unique complete 5-partite graphs G having 5n+4 vertices with certain star or matching deleted are obtained. Mathematics Subject Classification: 05C15
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.
