Lower bounds on signed edge total domination numbers in graphs

被引:0
|
作者
H. Karami
S. M. Sheikholeslami
Abdollah Khodkar
机构
[1] Azarbaijan University of Tarbiat Moallem,Department of Mathematics
[2] University of West Georgia,Department of Mathematics
来源
关键词
signed edge domination; signed edge total dominating function; signed edge total domination number;
D O I
暂无
中图分类号
学科分类号
摘要
The open neighborhood NG(e) of an edge e in a graph G is the set consisting of all edges having a common end-vertex with e. Let f be a function on E(G), the edge set of G, into the set {−1, 1}. If \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \sum\limits_{x \in N_G (e)} {f(x) \geqslant 1} $$\end{document} for each e ∈ E(G), then f is called a signed edge total dominating function of G. The minimum of the values \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \sum\limits_{e \in E(G)} {f(e)} $$\end{document}, taken over all signed edge total dominating function f of G, is called the signed edge total domination number of G and is denoted by γst′(G). Obviously, γst′(G) is defined only for graphs G which have no connected components isomorphic to K2. In this paper we present some lower bounds for γst′(G). In particular, we prove that γst′(T) ⩾ 2 − m/3 for every tree T of size m ⩾ 2. We also classify all trees T with γst′(T).
引用
收藏
页码:595 / 603
页数:8
相关论文
共 50 条
  • [1] LOWER BOUNDS ON SIGNED EDGE TOTAL DOMINATION NUMBERS IN GRAPHS
    Karami, H.
    Sheikholeslami, S. M.
    Khodkar, Abdollah
    [J]. CZECHOSLOVAK MATHEMATICAL JOURNAL, 2008, 58 (03) : 595 - 603
  • [2] On Signed Edge Total Domination Numbers of Graphs
    Jin Feng ZHAO
    [J]. Journal of Mathematical Research with Applications, 2011, (02) : 209 - 214
  • [3] On Signed Edge Total Domination Numbers of Graphs
    Jin Feng ZHAOBao Gen XU Department of MathematicsEast China Jiaotong UniversityJiangxi PRChina
    [J]. 数学研究与评论., 2011, 31 (02) - 214
  • [4] Lower bounds on the signed domination numbers of directed graphs
    Karami, H.
    Sheikholeslami, S. M.
    Khodkar, Abdollah
    [J]. DISCRETE MATHEMATICS, 2009, 309 (08) : 2567 - 2570
  • [5] BOUNDS ON THE INVERSE SIGNED TOTAL DOMINATION NUMBERS IN GRAPHS
    Atapour, M.
    Norouzian, S.
    Sheikholeslami, S. M.
    Volkmann, L.
    [J]. OPUSCULA MATHEMATICA, 2016, 36 (02) : 145 - 152
  • [6] Signed edge majority total domination numbers in graphs
    Karami, H.
    Sheikholeslami, S. M.
    Khodkar, Abdollah
    [J]. ARS COMBINATORIA, 2012, 105 : 375 - 385
  • [7] A lower bound on the total signed domination numbers of graphs
    Lu, Xin-zhong
    [J]. SCIENCE IN CHINA SERIES A-MATHEMATICS, 2007, 50 (08): : 1157 - 1162
  • [8] A lower bound on the total signed domination numbers of graphs
    Xin-zhong Lu
    [J]. Science in China Series A: Mathematics, 2007, 50 : 1157 - 1162
  • [9] A lower bound on the total signed domination numbers of graphs
    Xin-zhong LU Department of Mathematics
    [J]. Science China Mathematics, 2007, (08) : 1157 - 1162
  • [10] On signed edge domination numbers of graphs
    Xu, BG
    [J]. DISCRETE MATHEMATICS, 2001, 239 (1-3) : 179 - 189