Related papers: Zero forcing sets and controllability of dynamical…

In this paper, we study the target controllability problem of networked dynamical systems, in which we are tasked to steer a subset of network states towards a desired objective. More specifically, we derive necessary and sufficient…

The study of network structural controllability focuses on the minimum number of driver nodes needed to control a whole network. Despite intensive studies on this topic, most of them consider static networks only. It is well-known, however,…

The positive zero forcing number of a graph is a graph parameter that arises from a non-traditional type of graph colouring, and is related to a more conventional version of zero forcing. We establish a relation between the zero forcing and…

In this paper, we study the well-posedness and approximate controllability of a class of network systems having delays and controls at the boundary conditions. The particularity of this work is that the network system is defined on infinite…

Zero forcing is a combinatorial game played on a graph with a goal of turning all of the vertices of the graph black while having to use as few "unforced" moves as possible. This leads to a parameter known as the zero forcing number which…

In recent years complex networks have gained increasing attention in different fields of science and engineering. The problem of controlling these networks is an interesting and challenging problem to investigate. In this paper we look at…

A forcing set for a perfect matching of a graph is defined as a subset of the edges of that perfect matching such that there exists a unique perfect matching containing it. A complete forcing set for a graph is a subset of its edges, such…

The power domination number arises from the monitoring of electrical networks and its determination is an important problem. Upper bounds for power domination numbers can be obtained by constructions. Lower bounds for the power domination…

This paper considers the controllability problem for multi-agent systems. In particular, the structural controllability of multi-agent systems under switching topologies is investigated. The structural controllability of multi-agent systems…

This paper presents graph theoretic conditions for the controllability and accessibility of bilinear systems over the special orthogonal group, the special linear group and the general linear group, respectively, in the presence of drift…

In zero forcing, the focus is typically on finding the minimum cardinality of any zero forcing set in the graph; however, the number of cardinalities between $0$ and the number of vertices in the graph for which there are both zero forcing…

The optimization problem of the minimum set of leaders for the controllability of undirected graphs are addressed. It is difficult to find not only its optimal solution but also its approximate algorithm. We propose a new concept, namely…

Zero forcing is an iterative graph coloring process studied for its wide array of applications. In this process, the vertices of the graph are initially designated as blue or white, and a zero forcing set is a set of initially blue vertices…

The concept of zero forcing involves a dynamic coloring process by which blue vertices cause white vertices to become blue, with the goal of forcing the entire graph blue while choosing as few as possible vertices to be initially blue. Past…

The zero forcing process is an iterative graph colouring process in which at each time step a coloured vertex with a single uncoloured neighbour can force this neighbour to become coloured. A zero forcing set of a graph is an initial set of…

This paper presents new results and reinterpretation of existing conditions for strong structural controllability in a structured network determined by the zero/non-zero patterns of edges. For diffusively-coupled networks with self-loops,…

This document explores structural controllability of polynomial dynamical systems or polysystems. We extend Lin's concept of structural controllability for linear systems, offering hypergraph-theoretic methods to rapidly assess strong…

We study the notion of structured realizability for linear systems defined over graphs. A stabilizable and detectable realization is structured if the state-space matrices inherit the sparsity pattern of the adjacency matrix of the…

Liu et al recently proposed a minimum number of driver nodes needed to obtain full structural controllability over a directed network. Driver nodes are unmatched nodes, from which there are directed paths to all matched nodes. Their most…

A dynamical system is controllable if by imposing appropriate external signals on a subset of its nodes, it can be driven from any initial state to any desired state in finite time. Here we study the impact of various network…