|
 |
| Bimonthly Since 1986 |
ISSN 1004-9037
|
|
 |
|
|
| Publication Details |
Edited by: Editorial Board of Journal of Data Acquisition and Processing
P.O. Box 2704, Beijing 100190, P.R. China
Sponsored by: Institute of Computing Technology, CAS & China Computer Federation
Undertaken by: Institute of Computing Technology, CAS
Published by: SCIENCE PRESS, BEIJING, CHINA
Distributed by:
China: All Local Post Offices
|
|
|
|
| |
|
|
|
|
|
|
|
Abstract
A certified dominating set D of vertices in a connected graph G is minimal certified dominating set if no proper subset of D is an certified dominating set of G.The upper certified domination number ⌈_cer (G) is the maximum cardinality of a minimal certified dominating set of G. It is shown that for every positive integers a and b with 2≤a≤b there exists a connected graph G suchthat γ_cer (G)=a and ⌈_cer (G)=b.
Keyword
upper certified domination number, certified domination number, domination number.
PDF Download (click here)
|
|
|
|
|
