From the perspective of network attackers, finding attack sequences that can make significant damage on network controllability is an important task, which also helps defenders improve the robustness during network constructions. Therefore, developing effective attack strategies is a key aspect of research on network controllability and its robustness. In this paper, we propose a Leaf Node Neighbor-based Attack (LNNA) strategy that can effectively disrupt the controllability of undirected networks. The LNNA strategy targets the neighbors of leaf nodes, and when there are no leaf nodes in the network, the strategy attacks the neighbors of nodes with a higher degree to produce the leaf nodes. Results from simulations on synthetic and real-world networks demonstrate the effectiveness of the proposed method. In particular, our findings suggest that removing neighbors of low-degree nodes (i.e., nodes with degree 1 or 2) can significantly reduce the controllability robustness of networks. Thus, protecting such low-degree nodes and their neighbors during network construction can lead to networks with improved controllability robustness.

The application of transformations of the state equations of continuous linear and bilinear systems to the canonical form of controllability allows one to simplify the computation of Gramians of these systems. In the paper we developed the method and obtain algorithms for computation of the controllability and observability Gramians of continuous linear and bilinear stationary systems with many inputs and one output, based on the method of spectral expansion of the Gramians and the iterative method for computing the bilinear systems Gramians. An important feature of the concept is the idea of separability of the Gramians expansion: sep333arate computation of the scalar and matrix parts of the spectral Gramian expansion reduces the sub-Gramian matrices computation to calculation of numerical sequences of their elements. For the continuous linear systems with one output the method and the algorithm of the spectral decomposition of the controllability Gramian are developed in the form of Xiao matrices. Analytical expressions for the diagonal elements of the Gramian matrices are obtained, making use of which the rest elements can be calculated. For continuous linear systems with many outputs the spectral decompositions of the Gramians in the form of generalized Xiao matrices are obtained, which allows to significantly reduce the number of calculations. The obtained results are generalized for continuous bilinear systems with one output. Iterative spectral algorithms for computation of elements of Gramians of these systems are proposed. Examples are given that illustrate theoretical results.

In this paper, we study the problem of controllability of impulsive neutral evolution integrodifferential equations with state dependent delay in Banach spaces. The main results are completely new and are obtained by using Sadovskii's fixed point theorem, theory of resolvent operators, and an abstract phase space. An example is given to illustrate the theory.