Related papers: Laplacian Controllability of Threshold Graphs
In this paper, controllability of systems defined on graphs is discussed. We consider the problem of controllability of the network for a family of matrices carrying the structure of an underlying directed graph. A one-to-one correspondence…
Threshold graphs are graphs that can be characterized in a number of different ways. For example, they are graphs that are $P_4,\ C_4,\ 2K_2$--free. They may also be characterized by a finite sequence of positive integers $a_1, \ldots,…
A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…
We show that for every $n$-vertex graph with at least one edge, its treewidth is greater than or equal to $n \lambda_{2} / (\Delta + \lambda_{2}) - 1$, where $\Delta$ and $\lambda_{2}$ are the maximum degree and the second smallest…
We introduce a principled generative framework for graph signals that enables explicit control of feature heterophily, a key property underlying the effectiveness of graph learning methods. Our model combines a Lipschitz graphon-based…
The problem of leaders location plays an important role in the controllability of undirected graphs.The concept of minimal perfect critical vertex set is introduced by drawing support from the eigenvector of Laplace matrix. Using the notion…
Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…
Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…
We address the study of controllability of a closed quantum system whose dynamical Lie algebra is generated by adjacency matrices of graphs. We characterize a large family of graphs that renders a system controllable. The key property is a…
In this paper, several necessary and sufficient graphical conditions are derived for the controllability of multi-agent systems by taking advantage of the proposed concept of controllability destructive nodes. A key step of arriving at this…
We investigate the controllability of an infinite-dimensional quantum system: a quantum particle confined on a Thick Quantum Graph, a generalisation of Quantum Graphs whose edges are allowed to be manifolds of arbitrary dimension with…
The eigenvalues of the Laplacian matrix for a class of directed graphs with both positive and negative weights are studied. First, a class of directed signed graphs is investigated in which one pair of nodes (either connected or not) is…
The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. We find that the class of strongly regular graphs attains the maximum of largest…
We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that…
Zhu et al. [Theoret. Comput. Sci. 758 (2019) 1--8] introduced the $h$-edge tolerable diagnosability to measure the fault diagnosis capability of a multiprocessor system with faulty links. This kind of diagnosability is a generalization of…
In this paper, we develop a notion of controllability for hypergraphs via tensor algebra and polynomial control theory. Inspired by uniform hypergraphs, we propose a new tensor-based multilinear dynamical system representation, and derive a…
Network controllability is a powerful tool to study causal relationships in complex systems and identify the driver nodes for steering the network dynamics into desired states. However, due to ill-posed conditions, results become unreliable…
Let $G$ be a graph on $n$ vertices with adjacency matrix $A$, and let $\mathbf{1}$ be the all-ones vector. We call $G$ controllable if the set of vectors $\mathbf{1}, A\mathbf{1}, \dots, A^{n-1}\mathbf{1}$ spans the whole space…
This paper studies the controllability backbone problem in dynamical networks defined over graphs. The main idea of the controllability backbone is to identify a small subset of edges in a given network such that any subnetwork containing…
The control of dynamical, networked systems continues to receive much attention across the engineering and scientific research fields. Of particular interest is the proper way to determine which nodes of the network should receive external…