Domination with exponential decay

DOI10.1016/J.DISC.2008.06.040MaRDI QIDQ1045130zbMATH OpenOpenAlexFDO

Authors D. Erwin, Peter Dankelmann, David Day, Simon Mukwembi, H. C. Swart

Publication date 15 December 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2008.06.040

zbMATH Keywords

distancedomination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Bounds on the exponential domination number
• On exponential domination of some graphs
• Exponential Domination Critical and Stability in Some Graphs
• On exponential domination of \(C_m\times C_n\)
• Exponential independence

Cites work

• 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?)
• R -Domination in Graphs
• Domination in graphs with minimum degree two
• On the total influence number of a graph

Cited in

(29)

• Domination versus disjunctive domination in trees
• Domination versus disjunctive domination in graphs
• Hereditary equality of domination and exponential domination in subcubic graphs
• On disjunctive domination in graphs
• Exponential independence in subcubic graphs
• A vulnerability parameter of networks
• A variation of distance domination in composite networks
• On exponential domination of \(C_m\times C_n\)
• Games on Graphs: Cop and Robber, Hungry Spiders, and Broadcast Domination
• Efficient and non-efficient domination of \(\mathbb{Z}\)-stacked Archimedean lattices
• Exponential independence number of some graphs
• Bounds on the exponential domination number
• A linear programming method for exponential domination
• Exponential independence
• Disjunctive domination in graphs with minimum degree at least two
• On exponential domination and graph operations
• A constructive characterization of trees with equal total domination and disjunctive domination numbers
• Porous exponential domination in Harary graphs
• Stability and domination exponentially in some graphs
• Algorithmic aspects of \(b\)-disjunctive domination in graphs
• Domination with decay in triangular matchstick arrangement graphs
• Disjunctive total domination in permutation graphs
• Porous exponential domination number of some graphs
• Analysis of Vulnerability of Some Transformation Networks
• On exponential domination of some graphs
• Exponential domination in subcubic graphs
• Relating domination, exponential domination, and porous exponential domination
• Algorithmic aspects of disjunctive domination in graphs
• Hereditary equality of domination and exponential domination

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)