On the bondage number of middle graphs
Makaleler > Tam Makale · 2013
Yazarlar: Aysun AYTAÇ, T. TURACI, Z. N. Odabas
Mathematical Notes, SCI Expanded İndekslerine Giren Dergi, Uluslararası, Wos, 2013, cilt 93, ss 795-801
DOI: 10.1134/s0001434613050180
Özet
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.