Let gamma(G) be the domination number of a graph G, and let G x H be the direct product of graphs G and H. It is shown that for any k greater than or equal to 0 there exists a graph G such that gamma(G x C) less than or equal to gamma(G)(2) - k. This in particular disproves a conjecture from [5].
机构:
Anhui Univ, Ctr Pure Math, Sch Math Sci, Hefei 230601, Peoples R ChinaAnhui Univ, Ctr Pure Math, Sch Math Sci, Hefei 230601, Peoples R China
Peng, Xing
Song, Ge
论文数: 0引用数: 0
h-index: 0
机构:
Univ Sci & Technol China, Sch Publ Affairs, Hefei 230026, Anhui, Peoples R ChinaAnhui Univ, Ctr Pure Math, Sch Math Sci, Hefei 230601, Peoples R China
Song, Ge
Yuan, Long-Tu
论文数: 0引用数: 0
h-index: 0
机构:
East China Normal Univ, Sch Math Sci, Key Lab MEA, Minist Educ, 500 Dongchuan Rd, Shanghai 200240, Peoples R China
East China Normal Univ, Shanghai Key Lab PMMP, 500 Dongchuan Rd, Shanghai 200240, Peoples R ChinaAnhui Univ, Ctr Pure Math, Sch Math Sci, Hefei 230601, Peoples R China
机构:
Ferdowsi Univ Mashhad, Fac Math Sci, Dept Appl Math, POB 1159, Mashhad 91775, IranFerdowsi Univ Mashhad, Fac Math Sci, Dept Appl Math, POB 1159, Mashhad 91775, Iran