This paper investigates synchronization in complex dynamical networks (CDNs) with interval time-varying delays. The CDNs are representative of systems composed of a large number of interconnected dynamical units, and for the purpose of the mathematical analysis, the leading work is to model them as graphs whose nodes represent the dynamical units. At this time, we take note of the importance of each node in networks. One way, in this paper, is that the closeness-centrality mentioned in the field of social science is grafted onto the CDNs. By constructing a suitable Lyapunov-Krasovskii functional, and utilizing some mathematical techniques, the sufficient and closeness-centrality-based conditions for synchronization stability of the networks are established in terms of linear matrix inequalities. Ultimately, the use of the closeness-centrality can be weighted with regard to not only the interconnection relation among the nodes, which was utilized in the existing works but also more information about nodes. Here, the centrality will be added as the concerned information. Moreover, to avoid the computational burden causing the nonconvex term including the square of the time-varying delay, how to deal with it is applied by estimating it to the convex term including time-varying delay. Finally, two illustrative examples are given to show the advantage of the closeness-centrality in point of the robustness on time-delay.

This article proposes three new methods to enlarge the feasible region for guaranteeing stability for generalized neural networks having time-varying delays based on the Lyapunov method. First, two new zero equalities in which three states are augmented are proposed and inserted into the results of the time derivative of the constructed Lyapunov-Krasovskii functionals for the first time. Second, inspired by the Wirtinger-based integral inequality, new Lyapunov-Krasovskii functionals are introduced. Finally, by utilizing the relationship among the augmented vectors and from the original equation, newly augmented zero equalities are established and Finsler's lemma are applied. Through three numerical examples, it is verified that the proposed methods can contribute to enhance the allowable region of maximum delay bounds.