On The Bondage Number of Middle Graphs
Matematičeskie zametki, Tome 93 (2013) no. 6, pp. 803-811
Voir la notice de l'article provenant de la source Math-Net.Ru
Let $G = (V(G), E(G))$ be a simple graph. A subset $S$ of $V(G)$ is a dominating set of $G$ if, for any vertex $v \in {V(G)-S}$, there exists some vertex $u \in S$ such that $uv \in E(G)$. The domination number, denoted by $\gamma(G)$, is the cardinality of a minimal dominating set of $G$. There are several types of domination parameters depending upon the nature of domination and the nature of dominating set. These parameters are bondage, reinforcement, strong-weak domination, strong-weak bondage numbers. In this paper, we first investigate the strong-weak domination number of middle graphs of a graph. Then several results for the bondage, strong-weak bondage number of middle graphs are obtained.
Keywords:
connectivity, network design and communication, strong and weak domination number, bondage number, strong and weak bondage number, middle graphs.
@article{MZM_2013_93_6_a0,
author = {A. Ayta\c{c} and T. Turaci and Z. N. Odabas},
title = {On {The} {Bondage} {Number} of {Middle} {Graphs}},
journal = {Matemati\v{c}eskie zametki},
pages = {803--811},
publisher = {mathdoc},
volume = {93},
number = {6},
year = {2013},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_2013_93_6_a0/}
}
A. Aytaç; T. Turaci; Z. N. Odabas. On The Bondage Number of Middle Graphs. Matematičeskie zametki, Tome 93 (2013) no. 6, pp. 803-811. http://geodesic.mathdoc.fr/item/MZM_2013_93_6_a0/