Global defensive alliances in star graphs

CCUR > College of Business > Department of Information Management & Graduate Institute of Information Management > periodical articles > Item 987654321/20559

Please use this identifier to cite or link to this item: https://irlib.pccu.edu.tw/handle/987654321/20559

Title:	Global defensive alliances in star graphs
Authors:	Wang, FH (Wang, Fu-Hsing) Hsu, CJ (Hsu, Cheng-Ju) Wang, YL (Wang, Yue-Li)
Contributors:	資訊管理研究所
Keywords:	Defensive alliances Strong defensive alliances Dominating sets Star graphs
Date:	2009
Issue Date:	2011-11-30 16:15:50 (UTC+8)
Abstract:	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.
Appears in Collections:	[Department of Information Management & Graduate Institute of Information Management] periodical articles

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	643	View/Open