scientific article; zbMATH DE number 6102860
From MaRDI portal
Publication:4647737
zbMath1265.05325MaRDI QIDQ4647737
Z. N. Odabaş, Tufan Turaci, Aysun Aytaç
Publication date: 7 November 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items (6)
On the bondage, strong and weak bondage numbers in complementary prism graphs ⋮ The vulnerability of some networks including cycles via domination parameters ⋮ 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
This page was built for publication: