On exponential domination of some graphs
From MaRDI portal
Publication:2809918
zbMATH Open1342.05097MaRDI QIDQ2809918FDOQ2809918
Publication date: 30 May 2016
Published in: Nonlinear Dynamics and Systems Theory (Search for Journal in Brave)
Recommendations
dominationtotal graphnetwork design and communicationgraph vulnerabilityexponential domination number
Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Network design and communication in computer systems (68M10)
Cited In (13)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exponential Domination Critical and Stability in Some Graphs
- Exponential Independence Number of Some Graphs
- A linear programming method for exponential domination
- Hereditary equality of domination and exponential domination
- Relating domination, exponential domination, and porous exponential domination
- Analysis of Vulnerability of Some Transformation Networks
- Exponential independence in subcubic graphs
- Porous exponential domination in Harary graphs
- Exponential independence
- A variation of distance domination in composite networks
- Stability and domination exponentially in some graphs
This page was built for publication: On exponential domination of some graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2809918)