Document Type

Journal Article

Department/Unit

Department of Mathematics

Language

English

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 γrt(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.

Keywords

total domination number, total restrained domination number, direct product of graphs

Publication Date

2012

Source Publication Title

Discussiones Mathematicae Graph Theory

Volume

32

Issue

4

Start Page

629

End Page

641

Publisher

De Gruyter Open

Peer Reviewed

1

DOI

10.7151/dmgt.1632

Link to Publisher's Edition

http://dx.doi.org/10.7151/dmgt.1632

ISSN (print)

20835892

Included in

Mathematics Commons

Share

COinS