Global defensive alliances in star graphs

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

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

题名:	Global defensive alliances in star graphs
作者:	Wang, FH (Wang, Fu-Hsing) Hsu, CJ (Hsu, Cheng-Ju) Wang, YL (Wang, Yue-Li)
贡献者:	資訊管理研究所
关键词:	Defensive alliances Strong defensive alliances Dominating sets Star graphs
日期:	2009
上传时间:	2011-11-30 16:15:50 (UTC+8)
摘要:	A defensive alliance in a graph G = (V, E) is a set of vertices S subset of V satisfying the condition that, for each nu is an element of S, 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 nota defensive alliance any more. An alliances 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. (C) 2009 Elsevier B.V. All rights reserved.
显示于类别:	[資訊管理學系暨資訊管理研究所 ] 期刊論文

文件中的档案:

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

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