On signed majority total domination in graphs
Hua Ming Xing; Liang Sun; Xue-Gang Chen
Czechoslovak Mathematical Journal (2005)
- Volume: 55, Issue: 2, page 341-348
- ISSN: 0011-4642
Access Full Article
topAbstract
topHow to cite
topXing, Hua Ming, Sun, Liang, and Chen, Xue-Gang. "On signed majority total domination in graphs." Czechoslovak Mathematical Journal 55.2 (2005): 341-348. <http://eudml.org/doc/30948>.
@article{Xing2005,
abstract = {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 \{m\}aj\}\}^\{\{\,\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 \{m\}aj\}\}^\{\{\,\mathrm \{t\}\}\}(G)$.},
author = {Xing, Hua Ming, Sun, Liang, Chen, Xue-Gang},
journal = {Czechoslovak Mathematical Journal},
keywords = {signed majority total dominating function; signed majority total domination number; signed majority total dominating function; signed majority total domination number},
language = {eng},
number = {2},
pages = {341-348},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {On signed majority total domination in graphs},
url = {http://eudml.org/doc/30948},
volume = {55},
year = {2005},
}
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
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 55
IS - 2
SP - 341
EP - 348
AB - 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 {m}aj}}^{{\,\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 {m}aj}}^{{\,\mathrm {t}}}(G)$.
LA - eng
KW - signed majority total dominating function; signed majority total domination number; signed majority total dominating function; signed majority total domination number
UR - http://eudml.org/doc/30948
ER -
References
top- 10.1023/A:1013782511179, Czechoslovak Math. J. 51 (2001), 225–229. (2001) Zbl0977.05096MR1844306DOI10.1023/A:1013782511179
- 10.1016/0012-365X(94)00194-N, Discrete Math. 138 (1995), 125–135. (1995) MR1322087DOI10.1016/0012-365X(94)00194-N
- 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. (1998) Zbl0891.05042MR1605689
- 10.1016/S0012-365X(00)00370-8, Discrete Math. 239 (2001), 1–12. (2001) MR1850982DOI10.1016/S0012-365X(00)00370-8
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.