ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Dominating-x-Color Number of Harary Graph

Journal: International Journal of Science and Research (IJSR) (Vol.4, No. 3)

Publication Date:

Authors : ; ;

Page : 672-674

Keywords : Proper coloring; Chromatic number; Maximal independent set; Domination number; Dominating-color number;

Source : Downloadexternal Find it from : Google Scholarexternal


Let G = (V, E) be a graph. A graph G is k-colorable if it has a proper k-coloring. The chromatic number (G) is the least k such that G is k- colorable. In this paper, we examine the relation between the domination number, chromatic number and dominating -color number of Harary graph Hk, n. And we answer a question posed in [1] by showing that if q = 0, then (H_ (2r, n)) = p if not p + 1 such that n = (r + 1) s + t and n = ps + q with r t 0, s greater than q 0.

Last modified: 2021-06-30 21:34:49