CONDITIONAL GRAPH-THEORY .4. DOMINATING SETS

被引：0
|
作者：
HARARY, F
HAYNES, TW
机构：
[1] NEW MEXICO STATE UNIV, DEPT COMP SCI, LAS CRUCES, NM 88003 USA
[2] E TENNESSEE STATE UNIV, DEPT COMP SCI, JOHNSON CITY, TN 37614 USA
来源：
UTILITAS MATHEMATICA | 1995年 / 48卷
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A set S of nodes in a graph G = (V, E) is a dominating set if each node is either in S or is adjacent to some node in S. Following the theme of conditional graph theory, we extend ordinary domination to conditional domination and present a survey of the literature in which conditions are placed on the dominating set.
引用
收藏
页码：179 / 192
页数：14
相关论文
共 50 条
12345