Paired-domination of Trees
文献类型：期刊论文
| 作者 | Qiao, Hong ; Kang, Li Ying; Cardei, Mihaela; Du, Ding Zhu; Hong Qiao
|
| 刊名 | Journal of Global Optimization
 |
| 出版日期 | 2003-01 |
| 卷号 | 25期号:1页码:43-54 |
| 关键词 | brachytherapy branch-and-bound integer programming optimization prostate cancer treatment planning |
| 通讯作者 | Hong Qiao |
| 中文摘要 | |
| 英文摘要 | Let G= (V, E) be a graph without isolated vertices. A set S⊂V is a paired-dominating set if it dominates V and the subgraph induced by S,≤, contains a perfect matching. The paired-domination number γp(G) is defined to be the minimum cardinality of a paired-dominating set S in G. In this paper, we present a linear-time algorithm computing the paired-domination number for trees and characterize trees with equal domination and paired-domination numbers. |
| 源URL | [http://ir.ia.ac.cn/handle/173211/12596]  |
| 专题 | 自动化研究所_09年以前成果 |
| 通讯作者 | Hong Qiao |
| 作者单位 | Department of Manufacturing Engineering and Engineering Management |
| 推荐引用方式 GB/T 7714 | Qiao, Hong,Kang, Li Ying,Cardei, Mihaela,et al. Paired-domination of Trees[J]. Journal of Global Optimization,2003,25(1):43-54. |
| APA | Qiao, Hong,Kang, Li Ying,Cardei, Mihaela,Du, Ding Zhu,&Hong Qiao.(2003).Paired-domination of Trees.Journal of Global Optimization,25(1),43-54. |
| MLA | Qiao, Hong,et al."Paired-domination of Trees".Journal of Global Optimization 25.1(2003):43-54. |
入库方式： OAI收割
来源：自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。