| 关于图的符号边全控制数 |
| |
| 引用本文： | 赵金凤,徐保根. 关于图的符号边全控制数[J]. 数学研究及应用, 2011, 31(2): 209-214. DOI: 10.3770/j.issn:1000-341X.2011.02.003 |
| |
| 作者姓名： | 赵金凤 徐保根 |
| |
| 作者单位： | 华东交通大学基础科学学院, 江西 南昌 330013;华东交通大学基础科学学院, 江西 南昌 330013 |
| |
| 基金项目： | 国家自然科学基金(Grant No.11061014). |
| |
| 摘 要： | Let G = （V,E） be a graph.A function f ： E → {-1,1} is said to be a signed edge total dominating function （SETDF） of G if e ∈N（e） f（e ） ≥ 1 holds for every edge e ∈ E（G）.The signed edge total domination number γ st （G） of G is defined as γ st （G） = min{ e∈E（G） f（e）｜f is an SETDF of G}.In this paper we obtain some new lower bounds of γ st （G）.
|
| 关 键 词： | signed edge total dominating function signed edge total domination number edge degree |
| 收稿时间： | 2009-03-02 |
| 修稿时间： | 2010-10-03 |
On Signed Edge Total Domination Numbers of Graphs |
| |
| Jin Feng ZHAO and Bao Gen XU. On Signed Edge Total Domination Numbers of Graphs[J]. Journal of Mathematical Research with Applications, 2011, 31(2): 209-214. DOI: 10.3770/j.issn:1000-341X.2011.02.003 |
| |
| Authors: | Jin Feng ZHAO and Bao Gen XU |
| |
| Affiliation: | Department of Mathematics, East China Jiaotong University, Jiangxi 330013, P. R. China |
| |
| Abstract: | Let $G=(V,E)$ be a graph. A function $f:Erightarrow {-1,1} $ is said to be a signed edge total dominating function (SETDF) of $G$ if ${sum_{e^{^{prime }}in N(e)} }f(e^{prime})geq 1$ holds for every edge $ein E(G)$. The signed edge total domination number $gamma_{st}^{prime}(G)$ of $G$ is defined as $gamma_{st}^{prime}(G)=min{sum_{ein E(G)}f(e)|f$ is an SETDF of $G}$. In this paper we obtain some new lower bounds of $gamma_{st}^{prime}(G)$. |
| |
| Keywords: | signed edge total dominating function signed edge total domination number edge degree. |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
|
点击此处可从《数学研究及应用》下载全文 |
