資料載入中.....
|
請使用永久網址來引用或連結此文件:
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 | 693 | 檢視/開啟 |
|
在CCUR中所有的資料項目都受到原著作權保護.
|
