A note on neighborhood total domination in graphs

被引：0

作者：

Rad, Nader Jafari ^{[1
]}

机构：

[1] Shahrood Univ Technol, Dept Math, Shahrood, Iran

来源：

PROCEEDINGS OF THE INDIAN ACADEMY OF SCIENCES-MATHEMATICAL SCIENCES | 2015年 / 125卷 / 03期

关键词：

Neighborhood total domination; total domination;

D O I：

10.1007/s12044-015-0241-8

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G=(V,E) be a graph without isolated vertices. A dominating set S of G is called a neighborhood total dominating set (or just NTDS) if the induced subgraph G[N(S)] has no isolated vertex. The minimum cardinality of a NTDS of G is called the neighborhood total domination number of G and is denoted by gamma (nt)(G). In this paper, we obtain sharp bounds for the neighborhood total domination number of a tree. We also prove that the neighborhood total domination number is equal to the domination number in several classes of graphs including grid graphs.

引用

页码：271 / 276

页数：6