Total domination;
Total domination number;
TOTAL RESTRAINED DOMINATION;
SIGNED TOTAL DOMINATION;
EQUAL TOTAL DOMINATION;
PARALLEL ALGORITHMS;
PAIRED-DOMINATION;
PLANAR GRAPHS;
NUMBER;
TREES;
INTERVAL;
COMPLEXITY;
D O I:
10.1016/j.disc.2007.12.044
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. In this paper, we offer a survey of selected recent results on total domination in graphs. (C) 2008 Elsevier B.V. All rights reserved.
机构:
Kalasalingam Univ, Natl Ctr Adv Res Discrete Math nCARDMATH, Anand Nagar 626190, Krishnankoil, IndiaKalasalingam Univ, Natl Ctr Adv Res Discrete Math nCARDMATH, Anand Nagar 626190, Krishnankoil, India
Arumugam, S.
Sivagnanam, C.
论文数: 0引用数: 0
h-index: 0
机构:
St Josephs Coll Engn, Dept Math, Madras 600119, Tamil Nadu, IndiaKalasalingam Univ, Natl Ctr Adv Res Discrete Math nCARDMATH, Anand Nagar 626190, Krishnankoil, India