Minus domination number in cubic graph

作     者：KANG Liying CAI Maocheng 

作者机构：Department of Basic CourseShijiazhuang Railway Institute050043China Institute of Systems ScienceChinese Aeademy of SciencesBeijing 100080China Asian-Pacific Operations Research Center 

出 版 物：《Chinese Science Bulletin》 (中国科学通报)

年 卷 期：1998年第43卷第6期

页      面：444-447页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

主　　题：cubic graph minus domination signed domination 

摘      要：An upper bound is established on the parameter Γ -(G) for a cubic graph G and two infinite families of 3-connected graphs G k, G * k are constructed to show that the bound is sharp and, moreover, the difference Γ -(G * k)-γ s(G * k) can be arbitrarily large, where Г -(G * k) and γ s(G * k) are the upper minus domination and signed domination numbers of G * k, respectively. Thus two open problems are solved.