INVERSE DOMINATION IN GRAPHS

被引：0

作者：

KULLI, VR

SIGARKANTI, SC

机构：

来源：

NATIONAL ACADEMY SCIENCE LETTERS-INDIA | 1991年 / 14卷 / 12期

关键词：

GRAPH; DOMINATION NUMBER; INVERSE DOMINATION NUMBER;

D O I：

暂无

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

A set D of vertices in a graph G is a dominating set if every vertex not in D is adjacent to at least one vertex in D. Let D be a minimum dominating set of G. If V-D contains a dominating set say D' of G, then D' is called an inverse dominating set with respect to D. The inverse domination number gamma' (G) of G is the order of a smallest inverse dominating set of G. In this communication, we obtain the exact values of gamma' (G) for some standard graphs and also, we establish some general results on this parameter.

引用

页码：473 / 475

页数：3