| 图的整数值控制函数 |
| |
| 引用本文： | 康丽英,单而芳.图的整数值控制函数[J].上海大学学报(英文版),2007(5). |
| |
| 作者姓名： | 康丽英 单而芳 |
| |
| 作者单位： | Department of Mathematics College of Sciences，Shanghai University，Department of Mathematics，College of Sciences，Shanghai University，Shanghai 200444，P.R.China，Shanghai 200444，P.R.China |
| |
| 摘 要： | For an arbitrary subset P of the reals,a function f:V→P is defined to be a P-dominating function of a graph G=(V,E) if the sum of its function values over any closed neighbourhood is at least 1.That is,for every v∈V, f(Nv])≥1.The definition of total P-dominating function is obtained by simply changing‘closed’neighborhood Nv]in the definition of P-dominating function to‘open’neighborhood N(v).The (total) P-domination number of a graph G is defined to be the infimum of weight w(f) =∑_(v∈V)f(v) taken over all (total) P-dominating function f.Similarly,the P-edge and P-star dominating functions can be defined.In this paper we survey some recent progress oil the topic of dominating functions in graph theory.Especially,we are interested in P-,P-edge and P-star dominating functions of graphs with integer values.
|
Dominating functions with integer values in graphs——a survey |
| |
| KANG Li-ying,SHAN Er-fang.Dominating functions with integer values in graphs——a survey[J].Journal of Shanghai University(English Edition),2007(5). |
| |
| Authors: | KANG Li-ying SHAN Er-fang |
| |
| Abstract: | |
| |
| Keywords: | P-dominating function signed domination signed total domination minus domination minus total domination |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
