ملخص: We establish some new upper bounds for the sum and the product of the domination parameter [mu](G), where [mu]=ir,[gamma] or i, and the chromatic number [chi](G) of a graph G. We characterize graphs for which the upper bounds of [mu]+[chi] and [mu][chi] are achieved. Also an upper bound for the product [mu][chi][rho] is proved for any connected regular graph different from the cycle, where [rho] is the packing number. Finally, we give for any graph G with order n an upper bound which is a function of [rho] and n for the product of i(G) and . In particular, this bound improves a result of Cockayne, Favaron, Li and MacGillivray for any graph with a packing number equal to at least three.

لغة: إنجليزية