scientific article; zbMATH DE number 6102885
From MaRDI portal
Publication:4647762
zbMath1265.05333MaRDI QIDQ4647762
Publication date: 7 November 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
coronaindependence numberconnectivityvulnerabilitycovering numbernetwork design and communicationmiddle graphrupture degreeincomplete connected graph
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items (3)
On agglomeration-based rupture degree in networks and a heuristic algorithm ⋮ Exponential Independence Number of Some Graphs ⋮ Edge Rupture Degree of Graphs
This page was built for publication:
