On the bondage number of middle graphs |
| |
Authors: | A Aytaç T Turaci Z N Odaba? |
| |
Institution: | 19854. Ege University, Ege, Turkey 29854. Izmir University of Economics, Izmir, Turkey
|
| |
Abstract: | 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 ∈ V (G) — S, there exists some vertex u ∈ S such that uv ∈ E(G). The domination number, denoted by γ(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: | |
本文献已被 SpringerLink 等数据库收录! |
|