Global defensive alliances in star graphs

文化大學機構典藏 CCUR > 商學院 > 資訊管理學系暨資訊管理研究所 > 期刊論文 > Item 987654321/16964

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://irlib.pccu.edu.tw/handle/987654321/16964

题名:	Global defensive alliances in star graphs
作者:	王福星 Cheng-Ju Hsu Yue-Li Wang
贡献者:	資管系
关键词:	Defensive alliances Strong defensive alliances Dominating sets Star graphs
日期:	2009-04
上传时间:	2010-09-23 15:16:17 (UTC+8)
摘要:	A defensive alliance in a graph G=(V,E) is a set of vertices SV satisfying the condition that, for each vS, at least one half of its closed neighbors are in S. A defensive alliance S is called a critical defensive alliance if any vertex is removed from S, then the resulting vertex set is not a defensive alliance any more. An alliance S is called global if every vertex in V(G)S is adjacent to at least one member of the alliance S. In this paper, we shall propose a way for finding a critical global defensive alliance of star graphs. After counting the number of vertices in the critical global defensive alliance, we can derive an upper bound to the size of the minimum global defensive alliances in star graphs.
關聯:	Discrete Applied Mathematics V.157 P.1924-1931
显示于类别:	[資訊管理學系暨資訊管理研究所 ] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	713	检视/开启

在CCUR中所有的数据项都受到原著作权保护.