CASIA OpenIR  > 09年以前成果
Paired-domination of Trees
Qiao, Hong; Kang, Li Ying; Cardei, Mihaela; Du, Ding Zhu; Hong Qiao
Source PublicationJournal of Global Optimization
; Let G= (V, E) be a graph without isolated vertices. A set SV is a paired-dominating set if it dominates V and the subgraph induced by S,≤S\ge, 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.
KeywordBrachytherapy Branch-and-bound Integer Programming Optimization Prostate Cancer Treatment Planning
Document Type期刊论文
Corresponding AuthorHong Qiao
AffiliationDepartment of Manufacturing Engineering and Engineering Management
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Qiao, Hong]'s Articles
[Kang, Li Ying]'s Articles
[Cardei, Mihaela]'s Articles
Baidu academic
Similar articles in Baidu academic
[Qiao, Hong]'s Articles
[Kang, Li Ying]'s Articles
[Cardei, Mihaela]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Qiao, Hong]'s Articles
[Kang, Li Ying]'s Articles
[Cardei, Mihaela]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.