Geodesic
On signed majority total domination in graphs
Czechoslovak Mathematical Journal, Tome 55 (2005) no. 2, pp. 341-348
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

We initiate the study of signed majority total domination in graphs. Let $G=(V,E)$ be a simple graph. For any real valued function $f\: V \rightarrow \mathbb{R}$ and ${S\subseteq V}$, let $f(S)=\sum _{v\in S}f(v)$. A signed majority total dominating function is a function $f\: V\rightarrow \lbrace -1,1\rbrace $ such that $f(N(v))\ge 1$ for at least a half of the vertices $v\in V$. The signed majority total domination number of a graph $G$ is $\gamma _{{\mathrm maj}}^{{\,\mathrm t}}(G)=\min \lbrace f(V)\mid f$ is a signed majority total dominating function on $G\rbrace $. We research some properties of the signed majority total domination number of a graph $G$ and obtain a few lower bounds of $\gamma _{{\mathrm maj}}^{{\,\mathrm t}}(G)$.
We initiate the study of signed majority total domination in graphs. Let $G=(V,E)$ be a simple graph. For any real valued function $f\: V \rightarrow \mathbb{R}$ and ${S\subseteq V}$, let $f(S)=\sum _{v\in S}f(v)$. A signed majority total dominating function is a function $f\: V\rightarrow \lbrace -1,1\rbrace $ such that $f(N(v))\ge 1$ for at least a half of the vertices $v\in V$. The signed majority total domination number of a graph $G$ is $\gamma _{{\mathrm maj}}^{{\,\mathrm t}}(G)=\min \lbrace f(V)\mid f$ is a signed majority total dominating function on $G\rbrace $. We research some properties of the signed majority total domination number of a graph $G$ and obtain a few lower bounds of $\gamma _{{\mathrm maj}}^{{\,\mathrm t}}(G)$.
Classification : 05C35
Keywords: signed majority total dominating function; signed majority total domination number 
@article{CMJ_2005_55_2_a4,
     author = {Xing, Hua-Ming and Sun, Liang and Chen, Xue-Gang},
     title = {On signed majority total domination in graphs},
     journal = {Czechoslovak Mathematical Journal},
     pages = {341--348},
     year = {2005},
     volume = {55},
     number = {2},
     mrnumber = {2137141},
     zbl = {1081.05049},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMJ_2005_55_2_a4/}
}
TY  - JOUR
AU  - Xing, Hua-Ming
AU  - Sun, Liang
AU  - Chen, Xue-Gang
TI  - On signed majority total domination in graphs
JO  - Czechoslovak Mathematical Journal
PY  - 2005
SP  - 341
EP  - 348
VL  - 55
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/CMJ_2005_55_2_a4/
LA  - en
ID  - CMJ_2005_55_2_a4
ER  - 
%0 Journal Article
%A Xing, Hua-Ming
%A Sun, Liang
%A Chen, Xue-Gang
%T On signed majority total domination in graphs
%J Czechoslovak Mathematical Journal
%D 2005
%P 341-348
%V 55
%N 2
%U http://geodesic.mathdoc.fr/item/CMJ_2005_55_2_a4/
%G en
%F CMJ_2005_55_2_a4
Xing, Hua-Ming; Sun, Liang; Chen, Xue-Gang. On signed majority total domination in graphs. Czechoslovak Mathematical Journal, Tome 55 (2005) no. 2, pp. 341-348. http://geodesic.mathdoc.fr/item/CMJ_2005_55_2_a4/

[1] B.  Zelinka: Signed total domination number of a graph. Czechoslovak Math. J. 51 (2001), 225–229. | DOI | MR | Zbl

[2] I.  Broere, J. H.  Hattingh, M. A.  Henning and A. A. McRae: Majority domination in graphs. Discrete Math. 138 (1995), 125–135. | DOI | MR

[3] J. H.  Hattingh: Majority domination and its generalizations. Domination in Graphs: Advanced Topics, T. W.  Haynes, S. T.  Hedetniemi,and P. J. Slater (eds.), Marcel Dekker, New York, 1998. | MR | Zbl

[4] T. S.  Holm: On majority domination in graph. Discrete Math. 239 (2001), 1–12. | DOI | MR