The nonsplit domination number of a graph

被引：0

作者：

Kulli, VR ^{[1
]}

Janakiram, B ^{[1
]}

机构：

[1] Gulbarga Univ, Dept Math, Gulbarga 585106, India

来源：

INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS | 2000年 / 31卷 / 04期

关键词：

graph; domination number; nonsplit domination number;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A dominating set D of a graph G (V, E) is a nonsplit dominating set if the induced subgraph [V-D] is connected. The nonsplit domination number gamma(ns) (G) of G is the minimum cardinality of a nonsplit dominating set. In this paper, many bounds on gamma(ns) (G) are obtained and its exact values for some standard graphs ale found. Also, its relationship with other parameters is investigated.

引用

页码：441 / 447

页数：7