摘要
图G称为独立控制双临界的,如果去掉图中任何两点都使得独立控制数降低。首先讨论了一些特殊图类是独立控制双临界的,然后研究了独立控制双临界图的性质,最后给出了从较小的独立控制双临界图构造一个独立控制双临界图的方法。
A graph G is independent domination bicritical if the removal of any pair of vertices decreases the independ- ent domination number. Some particular classes of graphs which are independent domination bicritical are discussed and some properties of independent domination bicritical graphs are studied. Finally, ways of constructing an independent domination bicritical graph from smaller independent domination bicritical graphs are presented.
出处
《山东大学学报(理学版)》
CAS
CSCD
北大核心
2010年第10期40-44,共5页
Journal of Shandong University(Natural Science)
关键词
独立控制
独立控制双临界图
点-i-临界
independent domination number
independent domination bicritical graph
vertex-i-critical