On the total restrained domination number of direct products of graphs

Wai Chee Shiu; Hong-Yu Chen; Xue-Gang Chen; Pak Kiu Sun

Discussiones Mathematicae Graph Theory (2012)

  • Volume: 32, Issue: 4, page 629-641
  • ISSN: 2083-5892

Abstract

top
Let G = (V,E) be a graph. A total restrained dominating set is a set S ⊆ V where every vertex in V∖S is adjacent to a vertex in S as well as to another vertex in V∖S, and every vertex in S is adjacent to another vertex in S. The total restrained domination number of G, denoted by γ r t ( G ) , is the smallest cardinality of a total restrained dominating set of G. We determine lower and upper bounds on the total restrained domination number of the direct product of two graphs. Also, we show that these bounds are sharp by presenting some infinite families of graphs that attain these bounds.

How to cite

top

Wai Chee Shiu, et al. "On the total restrained domination number of direct products of graphs." Discussiones Mathematicae Graph Theory 32.4 (2012): 629-641. <http://eudml.org/doc/270917>.

@article{WaiCheeShiu2012,
abstract = {Let G = (V,E) be a graph. A total restrained dominating set is a set S ⊆ V where every vertex in V∖S is adjacent to a vertex in S as well as to another vertex in V∖S, and every vertex in S is adjacent to another vertex in S. The total restrained domination number of G, denoted by $γ_r^t(G)$, is the smallest cardinality of a total restrained dominating set of G. We determine lower and upper bounds on the total restrained domination number of the direct product of two graphs. Also, we show that these bounds are sharp by presenting some infinite families of graphs that attain these bounds.},
author = {Wai Chee Shiu, Hong-Yu Chen, Xue-Gang Chen, Pak Kiu Sun},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {total domination number; total restrained domination number; direct product of graphs},
language = {eng},
number = {4},
pages = {629-641},
title = {On the total restrained domination number of direct products of graphs},
url = {http://eudml.org/doc/270917},
volume = {32},
year = {2012},
}

TY - JOUR
AU - Wai Chee Shiu
AU - Hong-Yu Chen
AU - Xue-Gang Chen
AU - Pak Kiu Sun
TI - On the total restrained domination number of direct products of graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2012
VL - 32
IS - 4
SP - 629
EP - 641
AB - Let G = (V,E) be a graph. A total restrained dominating set is a set S ⊆ V where every vertex in V∖S is adjacent to a vertex in S as well as to another vertex in V∖S, and every vertex in S is adjacent to another vertex in S. The total restrained domination number of G, denoted by $γ_r^t(G)$, is the smallest cardinality of a total restrained dominating set of G. We determine lower and upper bounds on the total restrained domination number of the direct product of two graphs. Also, we show that these bounds are sharp by presenting some infinite families of graphs that attain these bounds.
LA - eng
KW - total domination number; total restrained domination number; direct product of graphs
UR - http://eudml.org/doc/270917
ER -

References

top
  1. [1] R. Chérifi, S. Gravier, X. Lagraula, C. Payan and I. Zigham, Domination number of cross products of paths, Discrete Appl. Math. 94 (1999) 101-139, doi: 10.1016/S0166-218X(99)00016-5. Zbl0923.05031
  2. [2] X.G. Chen, W.C. Shiu and H.Y. Chen, Trees with equal total domination and total restrained domination numbers, Discuss. Math. Graph. Theory 28 (2008) 59-66, doi: 10.7151/dmgt.1391. Zbl1169.05359
  3. [3] M. El-Zahar, S. Gravier and A. Klobucar, On the total domination number of cross products of graphs, Discrete Math. 308 (2008) 2025-2029, doi: 10.1016/j.disc.2007.04.034. Zbl1168.05344
  4. [4] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs ( Marcel Dekker, New York, 1998). Zbl0890.05002
  5. [5] D.X. Ma, X.G. Chen and L. Sun, On total restrained domination in graphs, Czechoslovak Math. J. 55 (2005) 165-173, doi: 10.1007/s10587-005-0012-2. Zbl1081.05086
  6. [6] D.F. Rall, Total domination in categorical products of graphs, Discuss. Math. Graph Theory 25 (2005) 35-44, doi: 10.7151/dmgt.1257. Zbl1074.05068
  7. [7] M. Zwierzchowski, Total domination number of the conjunction of graphs, Discrete Math. 307 (2007) 1016-1020, doi: 10.1016/j.disc.2005.11.047. Zbl1112.05083

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.