摘要
讨论了在粘合运算与去点运算下图的无赘数和上无赘数的变化 ,得到了几个不等式 .
The irredundance number and the upper irredundance number for the deletion of a vertex and the pasting of two vertices are discussed in this paper. Several inequalities are obtained. It is useful to do the further reseach on domination of graphs.
出处
《青岛科技大学学报（自然科学版）》
CAS
2004年第3期275-278,共4页
Journal of Qingdao University of Science and Technology:Natural Science Edition
关键词
控制集
无赘集
私邻点
domination set
irredundant set
private neighbor vertex
