Abstract
Excellence in graphs introduced by G.H. Fricke is extended to partitions of the vertex set with respect to a parameter. A graph G is said to be Chromatic excellent if {v} appears in a chromatic partition of G for every vϵV(G). This paper is devoted to the study of chromatic excellence in graphs.
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.
