| Total Dominating Set Games |
| |
| 作者姓名： | 方奇志 |
| |
| 作者单位： | Department of |
| |
| 基金项目： | SupportedbyNationalNaturalScienceFoundationofChina(No.10371114). |
| |
| 摘 要： | 1 DefinitionsIn this paper we discuss cooperative cost games that arise from total domination problems on graphs. A cooperative cost game (Г) = (N,c) consists of a player set N = {1,2,…,n} and a characteristic function c : 2N→R, where for each subset S(？)N, c(S) represents the cost incurred by the coalition of players in S. The central problem in cooperative game is
|
| 关 键 词： | 优势集 图论 游戏设计 协作成本 顶点加权函数 |
Total Dominating Set Games |
| |
| FANG Qi-zhi.Total Dominating Set Games[J].Advances in Mathematics,2005,34(1):121-124. |
| |
| Authors: | FANG Qi-zhi |
| |
| Abstract: | |
| |
| Keywords: | |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
