
arXiv: 1605.05056
We characterize a large subclass of the class of those graphs $G$ for which the exponential domination number of $H$ equals the domination number of $H$ for every induced subgraph $H$ of $G$.
exponential domination, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), 05c69, hereditary class, QA1-939, FOS: Mathematics, Mathematics - Combinatorics, Structural characterization of families of graphs, Combinatorics (math.CO), Mathematics, domination
exponential domination, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), 05c69, hereditary class, QA1-939, FOS: Mathematics, Mathematics - Combinatorics, Structural characterization of families of graphs, Combinatorics (math.CO), Mathematics, domination
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
