| 几乎正则图的全符号控制 |
| |
| 引用本文： | 康丽英,单而芳.几乎正则图的全符号控制[J].上海大学学报(英文版),2006,10(1):4-8. |
| |
| 作者姓名： | 康丽英 单而芳 |
| |
| 作者单位： | Department of Mathematics College of Sciences Shanghai University Shanghai 200444 P.R. China，Department of Mathematics College of Sciences Shanghai University Shanghai 200444 P.R. China |
| |
| 摘 要： | 1IntroductionFor notation and graph theory terminology we ingeneral follow1].LetG=(V,E)be a graph with thevertex setVand the edge setE,andletvbe a vertexinV.The open neighborhood ofvisN(v)={u∈V|uv∈E}and the closed neighborhood ofvisNv]={v}∪N(v).The d…
|
| 关 键 词： | 近似正则图 图论 符号整体控制 边界 |
| 文章编号： | 1007-6417（2006）01-0004-05 |
| 收稿时间： | 2005-09-01 |
Signed total domination in nearly regular graphs |
| |
| Li-ying Kang Ph. D.,Er-fang Shan.Signed total domination in nearly regular graphs[J].Journal of Shanghai University(English Edition),2006,10(1):4-8. |
| |
| Authors: | Li-ying Kang Ph D Er-fang Shan |
| |
| Institution: | Department of Mathematics, College of Sciences, Shanghai University, Shanghai 200444, P.R. China |
| |
| Abstract: | A function f:V(G)→{−1,1} defined on the vertices of a graph G is a signed total dominating function (STDF) if the sum of its function values over any open neighborhood is at least one.
An STDF f is minimal if there does not exist a STDF g:V(G)→{−1,l}, f ≠ g, for which g(v)≤f(v) for every v ε V(G). The weight of a STDF is the sum of its function values over all vertices. The signed total domination number of G is the minimum weight of a STDF of G, while the upper signed domination number of G is the maximum weight of a minimal STDF of G. In this paper, we present sharp upper bounds on the upper signed total domination number of a nearly regular graph.
Project supported by National Natural Science Foundation of China (Grant No. 10571117), and Developing Science Foundation
of Shanghai Education Committee (Grant No.05AZ04) |
| |
| Keywords: | signed total domination nearly regular graph bounds |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
