A subset $D\subseteq V_G$ is a dominating set of $G$ if every vertex in $V_G-D$ has a~neighbor $D$, while $D$ paired-dominating a~dominating and the subgraph induced by contains perfect matching. graph $D\!P\!D\!P$-graph it pair $(D,P)$ disjoint sets vertices such that $P$ $G$. The study $D\!P\!D\!P$-graphs was initiated Southey Henning (Cent. Eur. J. Math. 8 (2010) 459--467; Comb. Optim. 22 (2...

This paper develops a positive theory of growth and redistribution in which agents care about both their absolute and relative levels of consumption. As in Alesina and Rodrik (1994), public goods are productive and are financed by a tax on capital. Equilibrium tax policy is chosen by a pivotal voter and is shown to reflect the strength of status preferences and the distributions of wealth and p...

Recent advances have provided a first experimental protein interaction map of the human malaria parasite P. falciparum, which appears to be remotely related to interactomes of other eukaryotes. Here, we present a comparative topological analysis of this experimentally determined web with a network of conserved interactions between proteins in S. cerevisiae, C. elegans and D. melanogaster that h...

a dominating set $d subseteq v$ of a graph $g = (v,e)$ is said to be a connected cototal dominating set if $langle d rangle$ is connected and $langle v-d rangle neq phi$, contains no isolated vertices. a connected cototal dominating set is said to be minimal if no proper subset of $d$ is connected cototal dominating set. the connected cototal domination number $gamma_{ccl}(g)$ of $g$ is the min...

We conduct an extensive numerical analysis of the effects of network damage on dominating sets that occur at either randomly selected nodes or at the highest-degree nodes, in synthetic scale-free and real complex networks. We focus on the fraction of nodes that remain dominated after the damage has occurred, defined as stability. We find that minimum dominating sets (MDS), despite being optimal...