|
 |
| 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
In this article, the monophonic hull domination number γ_mh (G) of a graph G is introduced and the monophonic hull domination numbers of certain classes of graphs are determined. Connected graphs of order p with monophonic hull domination number 2,p,p-1 are characterized. It is shown that for any two integers a,b≥2 with 2≤a≤b, there exists a connected graph Gsuch that γ_mh (G)=a and γ_m (G)=b, where γ_m (G) is the monophonic domination number of a graph.
Keyword
monophonic hull number, domination number, monophonic hull domination number.
PDF Download (click here)
|
|
|
|
|
