Inequalities involving independence domination, f -domination, connected and total f -domination numbers

San Ming Zhou

Czechoslovak Mathematical Journal (2000)

  • Volume: 50, Issue: 2, page 321-330
  • ISSN: 0011-4642

Abstract

top
Let f be an integer-valued function defined on the vertex set V ( G ) of a graph G . A subset D of V ( G ) is an f -dominating set if each vertex x outside D is adjacent to at least f ( x ) vertices in D . The minimum number of vertices in an f -dominating set is defined to be the f -domination number, denoted by γ f ( G ) . In a similar way one can define the connected and total f -domination numbers γ c , f ( G ) and γ t , f ( G ) . If f ( x ) = 1 for all vertices x , then these are the ordinary domination number, connected domination number and total domination number of G , respectively. In this paper we prove some inequalities involving γ f ( G ) , γ c , f ( G ) , γ t , f ( G ) and the independence domination number i ( G ) . In particular, several known results are generalized.

How to cite

top

Zhou, San Ming. "Inequalities involving independence domination, $f$-domination, connected and total $f$-domination numbers." Czechoslovak Mathematical Journal 50.2 (2000): 321-330. <http://eudml.org/doc/30563>.

@article{Zhou2000,
abstract = {Let $f$ be an integer-valued function defined on the vertex set $V(G)$ of a graph $G$. A subset $D$ of $V(G)$ is an $f$-dominating set if each vertex $x$ outside $D$ is adjacent to at least $f(x)$ vertices in $D$. The minimum number of vertices in an $f$-dominating set is defined to be the $f$-domination number, denoted by $\gamma _\{f\}(G)$. In a similar way one can define the connected and total $f$-domination numbers $\gamma _\{c, f\}(G)$ and $\gamma _\{t, f\}(G)$. If $f(x) = 1$ for all vertices $x$, then these are the ordinary domination number, connected domination number and total domination number of $G$, respectively. In this paper we prove some inequalities involving $\gamma _\{f\}(G), \gamma _\{c, f\}(G), \gamma _\{t, f\}(G)$ and the independence domination number $i(G)$. In particular, several known results are generalized.},
author = {Zhou, San Ming},
journal = {Czechoslovak Mathematical Journal},
keywords = {domination number; independence domination number; $f$-domination number; connected $f$-domination number; total $f$-domination number; domination number; independence domination number; -domination number; connected -domination number; total -domination number},
language = {eng},
number = {2},
pages = {321-330},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Inequalities involving independence domination, $f$-domination, connected and total $f$-domination numbers},
url = {http://eudml.org/doc/30563},
volume = {50},
year = {2000},
}

TY - JOUR
AU - Zhou, San Ming
TI - Inequalities involving independence domination, $f$-domination, connected and total $f$-domination numbers
JO - Czechoslovak Mathematical Journal
PY - 2000
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 50
IS - 2
SP - 321
EP - 330
AB - Let $f$ be an integer-valued function defined on the vertex set $V(G)$ of a graph $G$. A subset $D$ of $V(G)$ is an $f$-dominating set if each vertex $x$ outside $D$ is adjacent to at least $f(x)$ vertices in $D$. The minimum number of vertices in an $f$-dominating set is defined to be the $f$-domination number, denoted by $\gamma _{f}(G)$. In a similar way one can define the connected and total $f$-domination numbers $\gamma _{c, f}(G)$ and $\gamma _{t, f}(G)$. If $f(x) = 1$ for all vertices $x$, then these are the ordinary domination number, connected domination number and total domination number of $G$, respectively. In this paper we prove some inequalities involving $\gamma _{f}(G), \gamma _{c, f}(G), \gamma _{t, f}(G)$ and the independence domination number $i(G)$. In particular, several known results are generalized.
LA - eng
KW - domination number; independence domination number; $f$-domination number; connected $f$-domination number; total $f$-domination number; domination number; independence domination number; -domination number; connected -domination number; total -domination number
UR - http://eudml.org/doc/30563
ER -

References

top
  1. 10.1016/0012-365X(78)90105-X, Discrete Math. 23 (1978), 73–76. (1978) MR0523402DOI10.1016/0012-365X(78)90105-X
  2. 10.1002/jgt.3190030306, J. Graph Theory 3 (1979), 241–249. (1979) MR0542545DOI10.1002/jgt.3190030306
  3. 10.1002/net.3230100304, Networks 10 (1980), 211–219. (1980) MR0584887DOI10.1002/net.3230100304
  4. n -domination in graphs. Graph Theory with Applications to Algorithms and Computer Science, John Wiley & Sons, New York, 1985, pp. 283–300. (1985) MR0812671
  5. On n -domination, n -dependence and forbidden subgraphs. Graph Theory with Applications to Algorithms and Computer Science, John Wiley & Sons, New York, 1985, pp. 301–311. (1985) MR0812672
  6. Combinatorics with Emphasis on the Theory of Graphs, Springer-Verlag, New York, 1977. (1977) MR0505525
  7. Domination in trees: models and algorithms. Graph Theory with Applications to Algorithms and Computer Science, John Wiley & Sons, New York, 1985, pp. 423–442. (1985) MR0812681
  8. A new domination conception, J. Graph Theory 17 (1993), 315–323. (1993) MR1220992
  9. 10.4153/CJM-1963-012-2, Canad. J. Math. 15 (1963), 106–111. (1963) Zbl0112.14803MR0153002DOI10.4153/CJM-1963-012-2
  10. On f -domination number of a graph, Czechoslovak Math. J. 46(121) (1996), 489–499. (1996) Zbl0879.05037MR1408300
  11. Invariants concerning f -domination in graphs. Combinatorics and Graph Theory ’95, World Scientific, River Edge, NJ, 1999. (1999) 
  12. Gallai-type equalities for f -domination and connected f -domination numbers, Graph Theory Notes of New York XXIX (1995), 30–32. (1995) 

NotesEmbed ?

top

You must be logged in to post comments.