On the total restrained domination number of direct products of graphs

2012 ◽  
Vol 32 (4) ◽  
pp. 629 ◽  
Author(s):  
Hong-yu. Chen ◽  
Xue-Gang Chen ◽  
Wai Chee Shiu ◽  
Pak Kiu Sun
2013 ◽  
Vol 2013 ◽  
pp. 1-6
Author(s):  
Adel P. Kazemi

In a graph with , a -tuple total restrained dominating set is a subset of such that each vertex of   is adjacent to at least vertices of and also each vertex of is adjacent to at least vertices of  . The minimum number of vertices of such sets in is the -tuple total restrained domination number of . In [-tuple total restrained domination/domatic in graphs, BIMS], the author initiated the study of the -tuple total restrained domination number in graphs. In this paper, we continue it in the complementary prism of a graph.


Sign in / Sign up

Export Citation Format

Share Document