scientific article
From MaRDI portal
Publication:2809918
zbMath1342.05097MaRDI QIDQ2809918
Publication date: 30 May 2016
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
dominationtotal graphnetwork design and communicationgraph vulnerabilityexponential domination number
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 (10)
Stability and domination exponentially in some graphs ⋮ Exponential independence ⋮ Porous exponential domination in Harary graphs ⋮ Hereditary equality of domination and exponential domination ⋮ Analysis of Vulnerability of Some Transformation Networks ⋮ Exponential Independence Number of Some Graphs ⋮ Relating domination, exponential domination, and porous exponential domination ⋮ Exponential independence in subcubic graphs ⋮ Exponential Domination Critical and Stability in Some Graphs ⋮ A linear programming method for exponential domination
This page was built for publication:
