The notion of the b-chromatic number of a graph attracted much research interests and recently a new concept, namely the b-chromatic sum of a graph, denoted by $ \varphi ^{\prime }(G) $, has also been introduced. Motivated by the studies on b-chromatic sum of graphs, in this paper we introduce certain new parameters such as $ \chi $-chromatic sum, $ \chi ^+ $-chromatic sum, $ b^+ $-chromatic sum, $ \pi $-chromatic sum and $ \pi ^+ $-chromatic sum of graphs. We also discuss certain results on these parameters for a selection of standard graphs
International audienceThe Minimum Sum Colouring Problem (MSCP) is a vertex colouring problem with a ...
In this paper we show upper bounds for the sum and the product of the lower domination parameters an...
In this paper, we investigate the b-chromatic number of central graph, middle graph and total graph ...
We recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the ...
The chromatic sum of a graph is the smallest sum of colors among all proper colorings with natural n...
AbstractThe chromatic sum of a graph is the minimum total of the colors on the vertices taken over a...
A Nordhaus-Gaddum-type result is a (tight) lower or upper bound on the sum or product of a parameter...
AbstractIn this paper we have investigated mainly the three colouring parameters of a graph G, viz.,...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
The total chromatic number of a graph $G$, denoted $\chi^{\prime\prime}(G)$, is the least number of ...
grantor: University of TorontoThe sum coloring problem asks to find a vertex coloring of ...
The absolute sum of chromatic polynomial coefficient of forest, q-tree, unicyclic graphs, and quasiw...
AbstractThe chromatic polynomial (or chromial) of a graph was first defined by Birkhoff in 1912, and...
International audienceThe b-chromatic number of a graph G is defined as the maximum number k of colo...
AbstractFor graphs G and H, let G⊕H denote their Cartesian sum. We investigate the chromatic number ...
International audienceThe Minimum Sum Colouring Problem (MSCP) is a vertex colouring problem with a ...
In this paper we show upper bounds for the sum and the product of the lower domination parameters an...
In this paper, we investigate the b-chromatic number of central graph, middle graph and total graph ...
We recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the ...
The chromatic sum of a graph is the smallest sum of colors among all proper colorings with natural n...
AbstractThe chromatic sum of a graph is the minimum total of the colors on the vertices taken over a...
A Nordhaus-Gaddum-type result is a (tight) lower or upper bound on the sum or product of a parameter...
AbstractIn this paper we have investigated mainly the three colouring parameters of a graph G, viz.,...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
The total chromatic number of a graph $G$, denoted $\chi^{\prime\prime}(G)$, is the least number of ...
grantor: University of TorontoThe sum coloring problem asks to find a vertex coloring of ...
The absolute sum of chromatic polynomial coefficient of forest, q-tree, unicyclic graphs, and quasiw...
AbstractThe chromatic polynomial (or chromial) of a graph was first defined by Birkhoff in 1912, and...
International audienceThe b-chromatic number of a graph G is defined as the maximum number k of colo...
AbstractFor graphs G and H, let G⊕H denote their Cartesian sum. We investigate the chromatic number ...
International audienceThe Minimum Sum Colouring Problem (MSCP) is a vertex colouring problem with a ...
In this paper we show upper bounds for the sum and the product of the lower domination parameters an...
In this paper, we investigate the b-chromatic number of central graph, middle graph and total graph ...