Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs

30Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

Let G = (V, E) be a graph. A set S ⊆ V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V - S is adjacent to a vertex in V - S. A set S ⊆ V is a restrained dominating set if every vertex in V - S is adjacent to a vertex in S and to a vertex in V - S. The total restrained domination number of G (restrained domination number of G, respectively), denoted by γtr (G) (γr (G), respectively), is the smallest cardinality of a total restrained dominating set (restrained dominating set, respectively) of G. We bound the sum of the total restrained domination numbers of a graph and its complement, and provide characterizations of the extremal graphs achieving these bounds. It is known (see [G.S. Domke, J.H. Hattingh, S.T. Hedetniemi, R.C. Laskar, L.R. Markus, Restrained domination in graphs, Discrete Math. 203 (1999) 61-69.]) that if G is a graph of order n ≥ 2 such that both G and over(G, -) are not isomorphic to P3, then 4 ≤ γr (G) + γr (over(G, -)) ≤ n + 2. We also provide characterizations of the extremal graphs G of order n achieving these bounds. © 2007 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Hattingh, J. H., Jonck, E., Joubert, E. J., & Plummer, A. R. (2008). Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs. Discrete Mathematics, 308(7), 1080–1087. https://doi.org/10.1016/j.disc.2007.03.061

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free