Abstract
Let [Formula: see text] be a certain type of proper [Formula: see text]-coloring of a given graph [Formula: see text] and [Formula: see text] denote the number of times a particular color [Formula: see text] is assigned to the vertices of [Formula: see text]. Then, the coloring sum of a given graph [Formula: see text] with respect to the coloring [Formula: see text], denoted by [Formula: see text] is defined to be [Formula: see text]. The coloring sums such as [Formula: see text]-chromatic sum, [Formula: see text]-chromatic sum, [Formula: see text]-chromatic sum, [Formula: see text]-chromatic sum, etc. are some of these types of coloring sums that have been studied recently. Motivated by these studies on certain chromatic sums of graphs, in this paper, we study certain chromatic sums for some standard cycle-related 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.
