Aytac, A.Turaci, T.Odabas, Z. N.2023-06-162023-06-1620130001-43461573-8876https://doi.org/10.1134/S0001434613050180https://hdl.handle.net/20.500.14365/2101Let 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.eninfo:eu-repo/semantics/closedAccessconnectivitynetwork design and communicationstrong and weak domination numberbondage numberstrong and weak bondage numbermiddle graphsDominationArticle10.1134/S00014346130501802-s2.0-84879753184