On the Stability Parameters of Lollipop Graphs

摘要：

In this paper we consider the domination number and bondage number of graph G. The domination number is defined as a minimum size of a dominating subset of vertices such that every other vertex not in it must be adjacent to some vertex in this subset. The bondage number is defined as the minimum number of edges whose removal results in a new graph with larger domination number. These parameters measure to some extent the robustness of an interconnection network with respect to link failures. By constructing a family of minimum dominating sets we compute the domination number and bondage number of the lollipop graph.

关键词： domination set domination number lollipop graph bondage number

作者: Jianxiang Cao Xin Feng

作者单位: School of Computer Science Communication University of China Beijing, 100024

会议类型: 国际会议

会议名称: 2012 International Conference on Computer Science and Electronic Engineering(2012 IEEE计算机科学与电子工程国际会议 ICCSEE 2012)

会议地点: 杭州

会议语种:英文

页码: 108-111

在线出版日期: 2012-03-23（万方平台首次上网日期，不代表论文的发表时间）