Graph Critical With Respect To Independent Domination

被引：1

作者：

Thakkar, D. K. ^{[1
]}

Bosamiya, J. C. ^{[1
]}

机构：

[1] Saurashtra Univ, Dept Math, Rajkot 360005, Gujarat, India

来源：

JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY | 2013年 / 16卷 / 2-3期

关键词：

Dominating set; Independent dominating set; Independent domination number; Vertex transitive graph; External private neighborhood;

D O I：

10.1080/09720529.2013.821773

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper we consider independent domination number of a graph and find out condition under which it changes when a vertex is removal. We also consider vertex transitive graphs and prove some results.

引用

页码：179 / 186

页数：8