Signed total domination in graphs
详细信息 查看全文
- 作者：Henning ; Michael A.
- 关键词：05C69 ; Signed total domination ; Bounds
- 刊名：Discrete Mathematics
- 出版年：2004
- 出版时间：March 6, 2004
- 年：2004
- 卷：278
- 期：1-3
- 页码：109-125
- 全文大小：275 K
文摘
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. A STDF f is minimal if there does not exist a STDF g:V(G)→{−1,1}, 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 total domination number of G is the maximum weight of a minimal STDF on G. In this paper we study these two parameters. In particular, we present lower bounds on the signed total domination number and upper bounds on the upper signed total domination number of a graph.
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 total domination number of G is the maximum weight of a minimal STDF on G. In this paper we study these two parameters. In particular, we present lower bounds on the signed total domination number and upper bounds on the upper signed total domination number of a graph.