On the bondage number of middle graphs

WOS: 000321274300018Let 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.Scientific and Technological Research Council of TurkeyTurkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK)The research of the second and third authors was supported by the Scientific and Technological Research Council of Turkey

Intestinal perforation caused by multiple magnet ingestion.

Multiple magnet ingestion is rare, but can cause serious gastrointestinal complications. We report a case of 7-year-old girl with multiple intestinal perforations caused by multiple magnet ingestion. The aim of this report is to draw attention to magnetic toys, results of magnet ingestion and the importance of timing of operation