Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14365/2101
Title: | On the bondage number of middle graphs | Authors: | Aytac, A. Turaci, T. Odabas, Z. N. |
Keywords: | connectivity network design and communication strong and weak domination number bondage number strong and weak bondage number middle graphs Domination |
Publisher: | Maik Nauka/Interperiodica/Springer | 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 a V (G) - S, there exists some vertex u a S such that uv a 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. | URI: | https://doi.org/10.1134/S0001434613050180 https://hdl.handle.net/20.500.14365/2101 |
ISSN: | 0001-4346 |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
SCOPUSTM
Citations
14
checked on Oct 2, 2024
WEB OF SCIENCETM
Citations
13
checked on Oct 2, 2024
Page view(s)
36
checked on Oct 7, 2024
Download(s)
24
checked on Oct 7, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.