检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:FANGQizhi
机构地区:[1]epartmentofMathematics,OceanUniversityofChina,Qingdao266071,Shandong,China
出 处:《Journal of Systems Science & Complexity》2004年第4期485-491,共7页系统科学与复杂性学报(英文版)
基 金:This research is supported by the National Natural Science Foundation of China (No. 10371114).
摘 要:In this paper, we study the existence of 0-1 universal minimal total dominating functions in a graph. We establish a formulation of linear inequalities to characterize universal minimal total dominating functions and show that for a kind of graphs whose adjacent matrices are balanced, the existence of universal minimal total dominating functions coincides with that of 0-1 ones. It is also proved that for general graphs, the problem of testing the existence of 0-1 universal minimal total dominating functions is NP-hard.
关 键 词:total dominating function (TDF) minimal total dominating function (MTDF) universal mtdf BALANCED NP-HARD
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.225