Total restrained domination in claw-free graphs

2008 ◽  
Vol 19 (1) ◽  
pp. 60-68 ◽  
Author(s):  
Hongxing Jiang ◽  
Liying Kang
2013 ◽  
Vol 7 (1) ◽  
pp. 26
Author(s):  
Zahra Tahmasbzadehbaee ◽  
D Soner Nandappa ◽  
Hossein Abdollahzadeh Ahangar ◽  
Doost Ali Mojdeh ◽  
Yancai Zhao

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.


2005 ◽  
Vol 55 (1) ◽  
pp. 165-173 ◽  
Author(s):  
De-Xiang Ma ◽  
Xue-Gang Chen ◽  
Liang Sun

Sign in / Sign up

Export Citation Format

Share Document