On the bondage number of middle graphs
From MaRDI portal
Publication:358187
DOI10.1134/S0001434613050180zbMath1269.05086OpenAlexW2071934684MaRDI QIDQ358187
Z. N. Odabaş, Tufan Turaci, Aysun Aytaç
Publication date: 16 August 2013
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434613050180
connectivitybondage numbermiddle graphsnetwork design and communicationstrong and weak bondage numberstrong and weak domination number
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items (7)
On the bondage, strong and weak bondage numbers in complementary prism graphs ⋮ The vulnerability of some networks including cycles via domination parameters ⋮ Complexity and bounds for disjunctive total bondage ⋮ On the average lower bondage number of graphs under join and corona operations ⋮ On the average lower bondage number of a graph ⋮ A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs ⋮ Exponential Independence Number of Some Graphs
Cites Work
This page was built for publication: On the bondage number of middle graphs