Certain chromatic sums of some cycle-related graph classes

From MaRDI portal
Publication:2821116




Abstract: Let mathcalC=c1,c2,c3,ldots,ck be a certain type of proper k-colouring of a given graph G and heta(ci) denote the number of times a particular colour ci is assigned to the vertices of G. Then, the colouring sum of a given graph G with respect to the colouring cC, denoted by omegacC(G), is defined to be omega(cC)=sumlimitsi=1ki,heta(ci). 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.









This page was built for publication: Certain chromatic sums of some cycle-related graph classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2821116)