Abstract
Let be a certain type of proper -colouring of a given graph and denote the number of times a particular colour is assigned to the vertices of . Then, the colouring sum of a given graph with respect to the colouring $\cC$, denoted by $ω_{\cC}(G)$, is defined to be $ω(\cC) = \sum\limits_{i=1}^{k}i\,θ(c_i)$. The colouring sums such as -chromatic sum, -chromatic sum, -chromatic sum, -chromatic sum etc. are some of these types of colouring 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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.