Nordhaus-Gaddum type results for connected and total domination

A dominating set of G = (V, E) is a subset S of V such that every vertex in V − S has at least one neighbor in S. A connected dominating set of G is a dominating set whose induced subgraph is connected. The minimum cardinality of a connected dominating set is the connected domination number γc(G). Let δ*(G) = min{δ(G), δ(G̅)}, where G̅ is the complement of G and δ(G) is the minimum vertex degree. In this paper, we improve upon existing results by providing new Nordhaus–Gaddum type results for connected domination. In particular, we show that if G and G̅ are both connected and min{γc(G), γc(G̅)} ≥ 3, then $ {\gamma }_c(G)+{\gamma }_c(\bar{G})\le 4+({\delta }^{\mathrm{*}}(G)-1)\left(\frac{1}{{\gamma }_c(G)-2}+\frac{1}{{\gamma }_c(\bar{G})-2}\right)$ and $ {\gamma }_c(G){\gamma }_c(\bar{G})\le 2({\delta }^{\mathrm{*}}(G)-1)\left(\frac{1}{{\gamma }_c(G)-2}+\frac{1}{{\gamma }_c(\bar{G})-2}+\frac{1}{2}\right)+4$ . Moreover, we establish accordingly results for total domination.

[1]  Michael A. Henning,et al.  Nordhaus-Gaddum bounds for total domination , 2011, Appl. Math. Lett..

[2]  Gayathri Mahalingam,et al.  Connected domination in graphs , 2005 .

[3]  Ermelinda DeLaViña,et al.  On Total Domination in Graphs , 2012 .

[4]  Seyed Mahmoud Sheikholeslami,et al.  An upper bound for total domination subdivision numbers , 2011, Ars Comb..

[5]  Anders Yeo,et al.  Total domination of graphs and small transversals of hypergraphs , 2007, Comb..

[6]  Mustapha Aouchiche,et al.  A survey of Nordhaus-Gaddum type relations , 2010, Discret. Appl. Math..

[7]  Michael A. Henning,et al.  Total domination in graphs with minimum degree three , 2000, J. Graph Theory.

[8]  Stephen T. Hedetniemi,et al.  Total domination in graphs , 1980, Networks.

[9]  Seyed Mahmoud Sheikholeslami,et al.  Connected Domination Number of a Graph and its Complement , 2012, Graphs Comb..

[10]  Liu Hai On the Total Domination Number of Graphs with Minimum Degree at Least Three , 2002 .

[11]  Michael A. Henning,et al.  Bounds on the connected domination number of a graph , 2013, Discret. Appl. Math..

[12]  P. Bama,et al.  Connected Domination Number of a Graph and Its Complement , 2018 .

[13]  Michael A. Henning,et al.  Graphs with large total domination number , 2000, J. Graph Theory.

[14]  Seyed Mahmoud Sheikholeslami,et al.  On two conjectures concerning total domination subdivision number in graphs , 2019, J. Comb. Optim..

[15]  L. Volkmann,et al.  SOME REMARKS ON α-DOMINATION , 2004 .

[16]  Seyed Mahmoud Sheikholeslami,et al.  Bounding the total domination subdivision number of a graph in terms of its order , 2011, J. Comb. Optim..

[17]  E. A. Nordhaus,et al.  On Complementary Graphs , 1956 .

[18]  Raphael Yuster,et al.  Some remarks on domination , 2004, J. Graph Theory.