Total Reinforcement Number of a Graph

被引：0

作者：

Sridharan, N. ^{[1
]}

Elias, M. ^{[2
]}

Subramanian, V. ^{[3
]}

机构：

[1] Alagappa Univ, Dept Math, Karaikkudi 630003, Tamil Nadu, India

[2] B U E T, Dept Math, Dhaka 1000, Bangladesh

[3] A P S A Coll, Dept Math, Tiruppatur 630211, India

来源：

AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS | 2007年 / 4卷 / 02期

关键词：

Total domination number; total reinforcement number;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A set D of vertices in a graph G - (V, E) is said to be a total dominating set of G if every vertex in V is adjacent to some vertex in D. The total domination number gamma(t)(G) is the minimum cardinality of a total dominating set. E(G(-)) denotes the edge set of G(-), the complement of G. The minimum cardinality of a set E-1 subset of E(G(-)) for which gamma(t)(G+ E1) < gamma(t)(G) is denoted by r(t)(G) and is called the total reinforcement number of G. The number r(t)(G) is well defined if gamma(t)(G) > 2. In this paper, we obtain some results on the total reinforcement number of a graph.

引用

页码：197 / 202

页数：6