# Certain Chromatic Sums of Some Cycle Related Graph Classes

Source: [Certain Chromatic Sums of Some Cycle Related Graph Classes](<https://www.sota2.com/research/paper/68fa52d81e209131ce97e8ca>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T12:08:00.691Z

Authors: N. K. Sudev, K. P. Chithra, Johan Kok

Published: 2016-06-01T13:01:58.000Z

## Abstract

Let $\\mathcal{C} = \\{c\_1,c\_2, c\_3, \\ldots,c\_k\\}$ be a certain type of proper $k$-colouring of a given graph $G$ and $\\theta(c\_i)$ denote the number of times a particular colour $c\_i$ is assigned to the vertices of $G$. Then, the colouring sum of a given graph $G$ with respect to the colouring $\\cC$, denoted by $\\omega\_{\\cC}(G)$, is defined to be $\\omega(\\cC) = \\sum\\limits\_{i=1}^{k}i\\,\\theta(c\_i)$. The colouring sums such as $\\chi$-chromatic sum, $\\chi^+$-chromatic sum, $b$-chromatic sum, $b^+$-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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1606.00268>)

[PDF](<https://arxiv.org/pdf/1606.00268.pdf>)
