Domination with exponential decay
From MaRDI portal
Recommendations
Cites work
- R -Domination in Graphs
- Domination in graphs with minimum degree two
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 1124605 (Why is no real title available?)
- scientific article; zbMATH DE number 2109329 (Why is no real title available?)
- On the total influence number of a graph
Cited in
(32)- Hereditary equality of domination and exponential domination
- Relating domination, exponential domination, and porous exponential domination
- Exponential independence in subcubic graphs
- A vulnerability parameter of networks
- Hereditary equality of domination and exponential domination in subcubic graphs
- Efficient and non-efficient domination of \(\mathbb{Z}\)-stacked Archimedean lattices
- Stability and domination exponentially in some graphs
- Porous exponential domination in Harary graphs
- Domination versus disjunctive domination in trees
- Domination with decay in triangular matchstick arrangement graphs
- Exponential independence
- On exponential domination of some graphs
- Disjunctive total domination in permutation graphs
- On exponential domination and graph operations
- Algorithmic aspects of disjunctive domination in graphs
- A linear programming method for exponential domination
- Exponential domination in subcubic graphs
- On disjunctive domination in graphs
- Domination versus disjunctive domination in graphs
- A constructive characterization of trees with equal total domination and disjunctive domination numbers
- Exponential independence number of some graphs
- Disjunctive domination in graphs with minimum degree at least two
- Porous exponential domination number of some graphs
- Games on Graphs: Cop and Robber, Hungry Spiders, and Broadcast Domination
- Analysis of Vulnerability of Some Transformation Networks
- On exponential domination of \(C_m\times C_n\)
- A variation of distance domination in composite networks
- Strength based domination in graphs
- Transversal total hop domination in graphs
- On perfect Italian domination in graphs
- Algorithmic aspects of \(b\)-disjunctive domination in graphs
- Bounds on the exponential domination number
This page was built for publication: Domination with exponential decay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045130)