Related papers: Power domination reconfiguration
We study the problem of controlling a general complex network towards an assigned synchronous evolution, by means of a pinning control strategy. We define the pinning-controllability of the network in terms of the spectral properties of an…
The ability to control a complex network towards a desired behavior relies on our understanding of the complex nature of these social and technological networks. The existence of numerous control schemes in a network promotes us to wonder:…
We describe a broad dynamical-algebraic framework for analyzing the quantum control properties of a set of naturally available interactions. General conditions under which universal control is achieved over a set of subspaces/subsystems are…
In the m-\emph{Eternal Domination} game, a team of guard tokens initially occupies a dominating set on a graph $G$. An attacker then picks a vertex without a guard on it and attacks it. The guards defend against the attack: one of them has…
In finite problems comprising objects, situations, and an object- and situation-contingent payoff function, we study the comparative statics of the set of undominated objects, meaning those for which there exists no mixture over objects…
The paper is an attempt to generalize a methodology, which is similar to the bounded-input bounded-output method currently widely used for the system stability studies. The presented earlier methodology allows decomposition of input space…
A key problem in network theory is how to reconfigure a graph in order to optimize a quantifiable objective. Given the ubiquity of networked systems, such work has broad practical applications in a variety of situations, ranging from drug…
Let $G=(V,E)$ be a graph. A subset $D\subseteq V$ is a dominating set if every vertex not in $D$ is adjacent to a vertex in $D$. The domination number of $G$, denoted by $\gamma(G)$, is the smallest cardinality of a dominating set of $G$.…
In formation control, an ensemble of autonomous agents is required to stabilize at a given configuration in the plane, doing so while agents are allowed to observe only a subset of the ensemble. As such, formation control provides a rich…
Finding tight bounds on the optimal solution is a critical element of practical solution methods for discrete optimization problems. In the last decade, decision diagrams (DDs) have brought a new perspective on obtaining upper and lower…
In order to make argumentation-based inference contestable, it is crucial to explain what changes can achieve a desired (instead of the contested) inference result. To this end, we introduce strength change explanations for quantitative…
Domination theory has been studied extensively in the context of binary monotone systems, where the structure function is a sum of products of the component state variables, and with coefficients given by the signed domination function.…
The significance of the PageRank algorithm in shaping the modern Internet cannot be overstated, and its Complex Network theory foundations continue to be a subject of research. In this article we carry out a systematic study of the…
Dominating broadcasting is a domination-type structure that models a transmission antenna network. In this paper, we study a limited version of this structure, that was proposed as a common framework for both broadcast and classical…
We present an approach to the solution of decision problems formulated as influence diagrams. This approach involves a special triangulation of the underlying graph, the construction of a junction tree with special properties, and a message…
The proper commuting graph $\mathcal{C}^{**}(G)$ of a finite group $G$ is the simple graph whose vertices are the noncentral elements of $G$ and two distinct vertices are adjacent if they commute. In this paper, we study the domination…
In this article we give a new definition of direct product of two arbitrary fuzzy graphs. We define the concepts of domination and total domination in this new product graph. We obtain an upper bound for the total domination number of the…
A dominating set of a graph is a subset $D$ of its vertices such that every vertex not in $D$ is adjacent to at least one member of $D$. The domination number of a graph $G$ is the number of vertices in a smallest dominating set of $G$. The…
We study a new reconfiguration problem inspired by classic mechanical puzzles: a colored token is placed on each vertex of a given graph; we are also given a set of distinguished cycles on the graph. We are tasked with rearranging the…
A common theme in all the above areas is designing a dynamical system to accomplish desired objectives, possibly in some predefined optimal way. Since control theory advances the idea of suitably modifying the behavior of a dynamical…