Average-delay impulsive control for synchronization of uncertain chaotic neural networks with variable delay impulses

Biwen Li; Yujie Liu; Biwen Li; Yujie Liu

doi:10.3934/mbe.2025052

Mathematical Biosciences and Engineering

2025, Volume 22, Issue 6: 1382-1398. doi: 10.3934/mbe.2025052

Previous Article Next Article

Research article Special Issues

Average-delay impulsive control for synchronization of uncertain chaotic neural networks with variable delay impulses

Biwen Li ,
Yujie Liu ^,

Huangshi Key Laboratory of Metaverse and Virtual Simulation, School of Mathematics and Statistics, Hubei Normal University, Huangshi 435002, China

Academic Editor: Mingji Zhang

Received: 18 March 2025 Revised: 13 April 2025 Accepted: 23 April 2025 Published: 30 April 2025

This paper investigated the synchronization issue of uncertain chaotic neural networks (CNNs) using a delayed impulsive control approach. To address the disturbances caused by parameter uncertainty and the flexibility of impulsive delays, the concept of average impulsive delay (AID) and average impulsive interval (AII) were utilized to handle the delays as a whole. Under the condition that the norms of uncertain parameters are bounded, the synchronization criteria for uncertain CNNs were derived based on linear matrix inequalities (LMIs). Specifically, we relaxed the constraints on the delay in the impulsive control inputs, thus allowing it to flexibly vary without being bound by some conditions, which provides a broader applicability compared to most existing results. Additionally, the results show that delayed impulses can facilitate the synchronization of uncertain CNNs. Finally, the validity of the theoretical results was verified through a numerical example.

Keywords:

Citation: Biwen Li, Yujie Liu. Average-delay impulsive control for synchronization of uncertain chaotic neural networks with variable delay impulses[J]. Mathematical Biosciences and Engineering, 2025, 22(6): 1382-1398. doi: 10.3934/mbe.2025052

Related Papers:

[1]	Yinwan Cheng, Chao Yang, Bing Yao, Yaqin Luo . Neighbor full sum distinguishing total coloring of Halin graphs. AIMS Mathematics, 2022, 7(4): 6959-6970. doi: 10.3934/math.2022386
[2]	Baolin Ma, Chao Yang . Distinguishing colorings of graphs and their subgraphs. AIMS Mathematics, 2023, 8(11): 26561-26573. doi: 10.3934/math.20231357
[3]	Ningge Huang, Lily Chen . AVD edge-colorings of cubic Halin graphs. AIMS Mathematics, 2023, 8(11): 27820-27839. doi: 10.3934/math.20231423
[4]	Huifen Ge, Shumin Zhang, Chengfu Ye, Rongxia Hao . The generalized 4-connectivity of folded Petersen cube networks. AIMS Mathematics, 2022, 7(8): 14718-14737. doi: 10.3934/math.2022809
[5]	Kai An Sim, Kok Bin Wong . On the cooling number of the generalized Petersen graphs. AIMS Mathematics, 2024, 9(12): 36351-36370. doi: 10.3934/math.20241724
[6]	Fugang Chao, Donghan Zhang . Neighbor sum distinguishing total choice number of IC-planar graphs with restrictive conditions. AIMS Mathematics, 2023, 8(6): 13637-13646. doi: 10.3934/math.2023692
[7]	Bana Al Subaiei, Ahlam AlMulhim, Abolape Deborah Akwu . Vertex-edge perfect Roman domination number. AIMS Mathematics, 2023, 8(9): 21472-21483. doi: 10.3934/math.20231094
[8]	Yanyi Li, Lily Chen . Injective edge coloring of generalized Petersen graphs. AIMS Mathematics, 2021, 6(8): 7929-7943. doi: 10.3934/math.2021460
[9]	Ali Raza, Mobeen Munir, Tasawar Abbas, Sayed M Eldin, Ilyas Khan . Spectrum of prism graph and relation with network related quantities. AIMS Mathematics, 2023, 8(2): 2634-2647. doi: 10.3934/math.2023137
[10]	Bao-Hua Xing, Nurten Urlu Ozalan, Jia-Bao Liu . The degree sequence on tensor and cartesian products of graphs and their omega index. AIMS Mathematics, 2023, 8(7): 16618-16632. doi: 10.3934/math.2023850

Abstract

1. Preliminaries

Let $G$ be a simple, non-trivial connected graph with vertex set $V(G)$ . For any two distinct vertices $u$ and $v$ in $G$ , $u$ - $v$ geodesic is a shortest walk between $u$ and $v$ without repetition of vertices. Two vertices are said to be adjacent if there is an edge between them, and they are also called neighbors of each other. The collection of all the neighbors of a vertex $v$ in $G$ is called the (open) neighborhood of $v$ , denoted by $N(v)$ .

A vertex $v$ of $G$ distinguishes a pair $(x, y)$ of distinct vertices of $G$ , if the number of edges in $v$ - $x$ geodesic is different from the number of edge in $v$ - $y$ geodesic. If $(x, y)$ is a pair of neighbors in $G$ , then $v$ is said to be adjacently distinguish the pair $(x, y)$ . Equivalently, a vertex $v$ adjacently distinguishes a pair $(x, y)$ of two neighbors if the difference between the number of edges in $v$ - $x$ geodesic and the number of edges in $v$ - $y$ geodesic is one.

A set $D \subseteq V(G)$ is a distinguishing set (metric generator) for $G$ if the members of $D$ distinguish every pair of distinct vertices in $G$ . The cardinality of a smallest distinguishing set for $G$ is called the metric dimension of $G$ , denoted by $dim(G)$ ^[7,23]. The concept of distinguishing set was introduced, very firstly, by Blumenthal ^[5] in the general context of metric spaces. It was later rediscovered and studied, in the context of graphs, by Slater with the name locating set/reference set ^[23]. Independently, Harary and Melter studied distinguishing set as resolving set (metric generator) ^[7,20]. Applications of this notion to the navigation of robots in networks are discussed in ^[13,21], and applications to pharmaceutical chemistry in ^[10,11]. For more details about the theory and applications of this notion, we refer the readers to the papers cited in ^{[3,5,8,9,12,13,14,15,19,22]} and the references therein.

A set $A \subseteq V(G)$ is a neighbor-distinguishing set (local metric generator) for $G$ if the members of $A$ adjacently distinguish every pair of neighboring (adjacent) vertices in $G$ . The cardinality of a smallest neighbor-distinguishing set for $G$ is called the adjacency (local) metric dimension of $G$ , and we denote it by $dim_a(G)$ .

The problem of distinguishing every two neighbors with the aid of distance (the number of edges in a geodesic) in a connected graph was introduced and studied by Okamoto et al. in 2010 ^[16]. Then, up till now, this notion endlessly received remarkable interest of many researchers working with distance in graphs. In 2015 and 2018, every two neighbors in the corona product of graphs are distinguished ^[6,18], while this problem for strong product and lexicographic product of graphs was solved in 2016 ^[4] and in 2018 ^[2,6], respectively. Using the neighbor-distinguishing problem of primary subgraphs, this problem was solved for the super graphs of these subgraphs in 2015 ^[17]. In 2018, Salman et al. proposed linear programming formulation for this problem and distinguished neighbors in two families of convex polytopes ^[19]. Recently, in 2019, split graphs of complete and complete bipartite graphs have been considered in the context of this problem ^[1]. Due to this noteworthy attention of researchers to this problem, we extend this study towards a very renowned family of generalized Petersen graphs in this article. Next, we state two results, proved by Okamoto et al. ^[16], and Salman et al. ^[19], respectively, which will be used in the sequel.

Theorem 1. ^[16] Let $G$ be a non-trivial connected graph of order $n$ . Then $dim_a(G)$ $= n-1$ if and only if $G$ is a complete graph, and $dim_a(G) = 1$ if and only if $G$ is a bipartite graph.

Proposition 2. ^[19] A subset $A$ of vertices in a connected graph $G$ is a neighbor-distinguishing set for $G$ if and only if for every $u\in V(G)$ and for each $v\in N(u)$ , the pair $(u, v)$ adjacently distinguished by some element of $A$ .

Watkins, in $1969$ ^[24], generalized the eminent Petersen graph, and proposed the notation $P(n, m)$ to this generalized family, where $n \geq 3$ and $1 \leq m \leq \lfloor \frac{n-1}{2} \rfloor$ . $P(n, m)$ is a cubic graph having the set

$V(P(n, m)) = \{ u_{1} , u_{2} , \dots, u_{n} , v_{1} , v_{2} , \dots, v_{n} \}$

as the vertex set, and the set

$E(P(n, m)) = \bigcup\limits_{i = 1}^{n}\left\{u_ix, v_iy\; ;\; x\in N(u_i), \; y \in N(v_i)\right\}$

as the edge set, where $N(u_i) = \{u_{i+1}, u_{i-1}, v_i \}$ and $N(v_i) = \{u_i, v_{i+m}, v_{i-m} \}$ for each $1 \leq i \leq n$ , and the indices greater than $n$ or less than $1$ will be taken modulo $n$ . Vertices $u_i$ and $v_i$ $(1 \leq i \leq n)$ are called the outer vertices and inner vertices, respectively, in $P(n, m)$ . Figure 1 depicts graphs to two different families of generalized Petersen graphs.

Figure 1. Generalized Petersen graphs

$P(15, 4)$ and

$P(16, 7)$ .

DownLoad: Full-Size Img PowerPoint

The rest of the paper is divided into two sections: one is on the family of generalized Petersen graphs $P(n, 4)$ ; and the second is on the family of generalized Petersen graphs $P(2n, n-1)$ . These families have been considered in the context of metric dimension problem by Naz et al. ^[15] and Ahmad et al. ^[3], respectively. Here, we solve the neighbor-distinguishing problem for these families.

2. Family of generalized Petersen graphs $P(n, 4)$

In the next result, we show that only two vertices of $P(n, 4)$ perform the neighbor-distinguishing.

Theorem 3. For $n\geq 9$ , let $G$ be a generalized Petersen graph $P(n, 4)$ , then a neighbor-distinguishing set for $G$ is a $2$ -element subset of $V(G)$ .

Proof. For $n = 9$ , it is an easy exercise to see that the set $A = \{v_1, v_2 \}$ is a neighbor-distinguishing set for $G$ . For $n\geq 10$ , let $A$ be a $2$ -element subset of $V(G)$ . Then, according to Proposition 2, we would perform neighbor-distinguishing for each pair $(x, y)$ , where $x \in V(G)$ and $y \in N(x)$ . Note that, if $x \in A$ , then $(x, y)$ is adjacently distinguished, because the number of edges in $y-x$ geodesic is $1$ , while the number of edges in $x-x$ geodesic is $0$ . Now, we discuss the following eight cases:

Case 1: ( $n = 8k$ with $k\geq 2$ )

Let $A = \{v_1 = a_1, v_3 = a_2\}$ , then

● the number of edges in $u_1-a_2$ geodesic is 3,

● the number of edges in $u_2-a_2$ geodesic is 2,

● the number of edges in $v_1-a_2$ geodesic is 4,

● the number of edges in $v_2-a_2$ geodesic is 3.

Further, and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 1. List of the number of edges in geodesics from the outer vertices to

$a \in A$ in

$P(n, 4)$ .

Geodesic	The number of edges in the geodesic
$u_i-a$	$i \equiv 0$ (mod 4)	$i \equiv 1$ (mod 4)	$i \equiv 2$ (mod 4)	$i \equiv 3$ (mod 4)
$n = 8k$ with $k\geq 2$ , and $A = \{v_1 = a_1, v_3 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+1$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+2\leq i \leq n$	$\frac{n-i+8}{4}$	$\frac{n-i+5}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+11}{4}$
$u_i- a_2$ , $3\leq i \leq 4k+3$	$\frac{i+4}{4}$	$\frac{i+7}{4}$	$\frac{i+6}{4}$	$\frac{i+1}{4}$
$u_i- a_2$ , $4k+4\leq i \leq n$	$\frac{n-i+12}{4}$	$\frac{n-i+13}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+7}{4}$
$n = 8k+1$ with $k\geq 2$ , and $A = \{v_1 = a_1, v_4 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+1$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+2\leq i \leq n$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$	$\frac{n-i+5}{4}$	$\frac{n-i+10}{4}$
$u_i- a_2$ , $4\leq i \leq 5k+1$	$\frac{i}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+5}{4}$
$u_i- a_2$ , $5k+2\leq i \leq n$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$	$\frac{n-i+13}{4}$	$\frac{n-i+14}{4}$
$n = 8k+2$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_2 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+2$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+3\leq i \leq n$	$\frac{n-i+10}{4}$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$	$\frac{n-i+5}{4}$
$u_i- a_2$ , $2\leq i \leq 4k+3$	$\frac{i+8}{4}$	$\frac{i+7}{4}$	$\frac{i+2}{4}$	$\frac{i+5}{4}$
$u_i- a_2$ , $4k+4\leq i \leq n$	$\frac{n-i+6}{4}$	$\frac{n-i+11}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+9}{4}$
$n = 8k+3$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_3 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+2$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+3\leq i \leq n$	$\frac{n-i+5}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$
$u_i- a_2$ , $3\leq i \leq 5k$	$\frac{i+4}{4}$	$\frac{i+7}{4}$	$\frac{i+6}{4}$	$\frac{i+1}{4}$
$u_i- a_2$ , $5k+1\leq i \leq n$	$\frac{n-i+13}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+7}{4}$	$\frac{n-i+12}{4}$
$n = 8k+4$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_4 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+3$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+4\leq i \leq n$	$\frac{n-i+8}{4}$	$\frac{n-i+5}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+11}{4}$
$u_i- a_2$ , $3\leq i \leq 5k+2$	$\frac{i}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+5}{4}$
$u_i- a_2$ , $5k+3\leq i \leq n$	$\frac{n-i+8}{4}$	$\frac{n-i+13}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+11}{4}$
$n = 8k+5$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_2 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 5k+1$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $5k+2\leq i \leq n$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$	$\frac{n-i+5}{4}$	$\frac{n-i+10}{4}$
$u_i- a_2$ , $2\leq i \leq 5k+2$	$\frac{i+8}{4}$	$\frac{i+7}{4}$	$\frac{i+2}{4}$	$\frac{i+5}{4}$
$u_i- a_2$ , $5k+3\leq i \leq n$	$\frac{n-i+11}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+9}{4}$	$\frac{n-i+6}{4}$
$n = 8k+6$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_2 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+2$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+6\leq i \leq n$	$\frac{n-i+10}{4}$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$	$\frac{n-i+5}{4}$
$u_i- a_2$ , $1\leq i \leq 4k+3$	$\frac{i+8}{4}$	$\frac{i+7}{4}$	$\frac{i+2}{4}$	$\frac{i+5}{4}$
$u_i- a_2$ , $4k+7\leq i \leq n$	$\frac{n-i+6}{4}$	$\frac{n-i+11}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+9}{4}$
$n = 8k+7$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_3 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+3$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+6\leq i \leq n$	$\frac{n-i+5}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$
$u_i- a_2$ , $2\leq i \leq 5k+1$	$\frac{i+4}{4}$	$\frac{i+7}{4}$	$\frac{i+6}{4}$	$\frac{i+1}{4}$
$u_i- a_2$ , $5k+4\leq i \leq n$	$\frac{n-i+13}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+7}{4}$	$\frac{n-i+12}{4}$

| Show Table

DownLoad: CSV

Table 2. List of the number of edges in geodesics from the inner vertices to

$a \in A$ in

$P(n, 4)$ .

Geodesic	The number of edges in the geodesic.
$v_i-a$	$i \equiv 0$ (mod 4)	$i \equiv 1$ (mod 4)	$i \equiv 2$ (mod 4)	$i \equiv 3$ (mod 4)
$n = 8k$ with $k\geq 2$ , and $A = \{v_1 = a_1, v_3 = a_2\}$
$v_i - a_1$ , $1\leq i \leq 4k+1$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i - a_1$ , $4k+2\leq i \leq n$	$\frac{n-i+12}{4}$	$\frac{n-i+1}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+15}{4}$
$v_i - a_2$ , $3\leq i \leq 4k+3$	$\frac{i+8}{4}$	$\frac{i+11}{4}$	$\frac{i+10}{4}$	$\frac{i-3}{4}$
$v_i- a_2$ , $4k+4\leq i \leq n$	$\frac{n-i+16}{4}$	$\frac{n-i+17}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+3}{4}$
$n = 8k+1$ with $k\geq 2$ , and $A = \{v_1 = a_1, v_4 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 3k+1$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $3k+10\leq i \leq n$	$\frac{n-i+15}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+1}{4}$	$\frac{n-i+14}{4}$
$v_i- a_2$ , $4\leq i \leq 4k$	$\frac{i-4}{4}$	$\frac{i+7}{4}$	$\frac{i+10}{4}$	$\frac{i+9}{4}$
$v_i- a_2$ , $4k+6\leq i \leq n$	$\frac{n-i+15}{4}$	$\frac{n-i+4}{4}$	$\frac{n-i+17}{4}$	$\frac{n-i+18}{4}$
$n = 8k+2$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_2 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 3k+2$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $3k+10\leq i \leq n$	$\frac{n-i+14}{4}$	$\frac{n-i+15}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+1}{4}$
$v_i- a_2$ , $2\leq i \leq 3k+3$	$\frac{i+12}{4}$	$\frac{i+11}{4}$	$\frac{i-2}{4}$	$\frac{i+9}{4}$
$v_i- a_2$ , $3k+11\leq i \leq n$	$\frac{n-i+2}{4}$	$\frac{n-i+15}{4}$	$\frac{n-i+16}{4}$	$\frac{n-i+13}{4}$
$n = 8k+3$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_3 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 3k+3$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $3k+10\leq i \leq n$	$\frac{n-i+1}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+15}{4}$	$\frac{n-i+12}{4}$
$v_i- a_2$ , $3\leq i \leq 4k+1$	$\frac{i+8}{4}$	$\frac{i+11}{4}$	$\frac{i+10}{4}$	$\frac{i-3}{4}$
$v_i- a_2$ , $4k+8\leq i \leq n$	$\frac{n-i+17}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+3}{4}$	$\frac{n-i+16}{4}$
$n = 8k+4$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_4 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 4k+3$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $4k+4\leq i \leq n$	$\frac{n-i+12}{4}$	$\frac{n-i+1}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+15}{4}$
$v_i- a_2$ , $3\leq i \leq 5k+2$	$\frac{i-4}{4}$	$\frac{i+7}{4}$	$\frac{i+10}{4}$	$\frac{i+9}{4}$
$v_i- a_2$ , $5k+3\leq i \leq n$	$\frac{n-i+4}{4}$	$\frac{n-i+17}{4}$	$\frac{n-i+18}{4}$	$\frac{n-i+15}{4}$
$n = 8k+5$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_2 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 4k+1$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $4k+6\leq i \leq n$	$\frac{n-i+15}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+1}{4}$	$\frac{n-i+14}{4}$
$v_i- a_2$ , $2\leq i \leq 4k+2$	$\frac{i+12}{4}$	$\frac{i+11}{4}$	$\frac{i-2}{4}$	$\frac{i+9}{4}$
$v_i- a_2$ , $4k+7\leq i \leq n$	$\frac{n-i+15}{4}$	$\frac{n-i+16}{4}$	$\frac{n-i+13}{4}$	$\frac{n-i+2}{4}$
$n = 8k+6$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_2 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 3k+2$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $3k+14\leq i \leq n$	$\frac{n-i+14}{4}$	$\frac{n-i+15}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+1}{4}$
$v_i- a_2$ , $1\leq i \leq 3k+3$	$\frac{i+12}{4}$	$\frac{i+11}{4}$	$\frac{i-2}{4}$	$\frac{i+9}{4}$
$v_i- a_2$ , $3k+15\leq i \leq n$	$\frac{n-i+2}{4}$	$\frac{n-i+15}{4}$	$\frac{n-i+16}{4}$	$\frac{n-i+13}{4}$
$n = 8k+7$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_3 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 3k+3$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $3k+14\leq i \leq n$	$\frac{n-i+1}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+15}{4}$	$\frac{n-i+12}{4}$
$v_i- a_2$ , $2\leq i \leq 4k+1$	$\frac{i+8}{4}$	$\frac{i+11}{4}$	$\frac{i+10}{4}$	$\frac{i-3}{4}$
$v_i- a_2$ , $4k+12\leq i \leq n$	$\frac{n-i+17}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+3}{4}$	$\frac{n-i+16}{4}$

| Show Table

DownLoad: CSV

Case 2: ( $n = 8k+1$ with $k\geq 2$ )

Let $A = \{v_1 = a_1, v_4 = a_2\}$ , then

● the number of edges in $u_1-a_2$ geodesic is 3,

● the number of edges in $u_2-a_2$ geodesic is 3,

● the number of edges in $u_3-a_2$ geodesic is 2.

Further, – provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 3.

$\lambda_i$ is the number of edges in a

$v_i-a_1$ geodesic, and

$\lambda_j$ is the number of edges in a

$v_j-a_2$ geodesic.

$i$	$3k+2 \equiv 2 (mod \ 4)$	$3k+3 \equiv 3 (mod \ 4)$	$3k+4 \equiv 0 (mod \ 4)$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$
$\lambda_i$	$\frac{5k}{4}$	$\frac{3k+16}{4}$	$\frac{3k+16}{4}$	$\frac{3k+4}{4}$	$\frac{5k-4}{4}$	$\frac{5k+8}{4}$	$\frac{5k+8}{4}$	$\frac{3k+8}{4}$
$j$	$1$	$2$	$3$	$4k+1 \equiv 1 (mod \ 4)$	$4k+2 \equiv 2 (mod \ 4)$	$4k+3 \equiv 3 (mod \ 4)$	$4k+4 \equiv 0 (mod \ 4)$	$4k+5 \equiv 1 (mod \ 4)$
$\lambda_j$	$4$	$4$	$3$	$k+1$	$k+3$	$k+3$	$k$	$k$

| Show Table

DownLoad: CSV

Case 3: ( $n = 8k+2$ with $k\geq 1$ )

Let $A = \{v_1 = a_1, v_2 = a_2\}$ , then

● the number of edges in $u_2-a_2$ geodesic is 2.

Further, , and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 4.

$\lambda_i$ is the number of edges in a

$v_i-a_1$ geodesic, and

$\lambda_j$ is the number of edges in a

$v_j-a_2$ geodesic.

$i$	$3k+3 \equiv 3 (mod \ 4)$	$3k+4 \equiv 0 (mod \ 4)$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$	$-$	$-$
$\lambda_i$	$\frac{5k}{4}$	$\frac{3k+16}{4}$	$\frac{3k+4}{4}$	$\frac{3k+16}{4}$	$\frac{5k-4}{4}$	$\frac{5k+8}{4}$	$\frac{3k+8}{4}$	$-$	$-$
$j$	$1$	$2$	$3k+4 \equiv 0 (mod \ 4)$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$	$3k+10 \equiv 2 (mod \ 4)$
$\lambda_j$	$3$	$0$	$\frac{5k}{4}$	$\frac{3k+16}{4}$	$\frac{3k+4}{4}$	$\frac{5k+8}{4}$	$\frac{5k-4}{4}$	$\frac{5k+8}{4}$	$\frac{3k+8}{4}$

| Show Table

DownLoad: CSV

Case 4: ( $n = 8k+3$ with $k\geq 1$ )

Let $A = \{v_1 = a_1, v_3 = a_2\}$ , then

● the number of edges in $u_1-a_2$ geodesic is 3,

● the number of edges in $u_2-a_2$ geodesic is 2.

Further, , and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 5.

$\lambda_i$ is the number of edges in a

$v_i-a_1$ geodesic, and

$\lambda_j$ is the number of edges in a

$v_j-a_2$ geodesic.

$i$	$3k+4 \equiv 0 (mod \ 4)$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$	$-$	$-$
$\lambda_i$	$\frac{5k}{4}$	$\frac{3k+4}{4}$	$\frac{3k+16}{4}$	$\frac{5k+8}{4}$	$\frac{5k-4}{4}$	$\frac{3k+8}{4}$	$-$	$-$
$j$	$1$	$2$	$4k+2 \equiv 2 (mod \ 4)$	$4k+3 \equiv 3 (mod \ 4)$	$4k+4 \equiv 0 (mod \ 4)$	$4k+5 \equiv 1 (mod \ 4)$	$4k+6 \equiv 2 (mod \ 4)$	$4k+7\equiv 3 (mod \ 4)$
$\lambda_j$	$4$	$3$	$k+1$	$k$	$k+3$	$k+3$	$k$	$k+1$

| Show Table

DownLoad: CSV

Case 5: ( $n = 8k+4$ with $k\geq 1$ )

Let $A = \{v_1 = a_1, v_4 = a_2\}$ , then

● the number of edges in $v_1-a_2$ geodesic is 4,

● the number of edges in $v_2-a_2$ geodesic is 4,

● the number of edges in $u_1-a_2$ geodesic is 3,

● the number of edges in $u_2-a_2$ geodesic is 3.

Moreover, and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Case 6: ( $n = 8k+5$ with $k\geq 1$ )

Let $A = \{v_1 = a_1, v_2 = a_2\}$ , then

● the number of edges in $u_1-a_2$ geodesic is 2,

● the number of edges in $v_1-a_2$ geodesic is 3.

Further, , and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 6.

$\lambda_i$ is the number of edges in a

$v_i-a_1$ geodesic, and

$\lambda_j$ is the number of edges in a

$v_j-a_2$ geodesic.

$i$	$4k+2 \equiv 2 (mod \ 4)$	$4k+3 \equiv 3 (mod \ 4)$	$4k+4 \equiv 0 (mod \ 4)$	$4k+5 \equiv 1 (mod \ 4)$
$\lambda_i$	$k+1$	$k+4$	$k+4$	$k+1$
$j$	$4k+3 \equiv 3 (mod \ 4)$	$4k+4 \equiv 0 (mod \ 4)$	$4k+5 \equiv 1 (mod \ 4)$	$4k+6 \equiv 2 (mod \ 4)$
$\lambda_j$	$k+1$	$k+4$	$k+4$	$k+1$

| Show Table

DownLoad: CSV

Case 7: ( $n = 8k+6$ with $k\geq 1$ )

Let $A = \{v_1 = a_1, v_2 = a_2\}$ , then

● the number of edges in $v_{3k+3}-a_1$ geodesic is $\frac{5k+4}{4} \equiv 3 (mod \ 4)$ ,

● the number of edges in $v_{3k+4}-a_2$ geodesic is $\frac{5k+4}{4} \equiv 0 (mod \ 4)$ ,

● the number of edges in $u_{4k+3}-a_1$ geodesic is $k+2$ ,

● the number of edges in $u_{4k+4}-a_1$ geodesic is $k+3$ ,

● the number of edges in $u_{4k+5}-a_1$ geodesic is $k+2$ ,

● the number of edges in $u_{4k+4}-a_2$ geodesic is $k+2$ ,

● the number of edges in $u_{4k+5}-a_2$ geodesic is $k+3$ ,

● the number of edges in $u_{4k+6}-a_2$ geodesic is $k+2$ .

Further, , and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 7.

$\lambda_i$ is the number of edges in a

$v_i-a_1$ geodesic, and

$\lambda_j$ is the number of edges in a

$v_j-a_2$ geodesic.

$i$	$3k+4 \equiv 0 (mod \ 4)$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$	$3k+10 \equiv 2 (mod \ 4)$	$3k+11 \equiv 3 (mod \ 4)$	$3k+12 \equiv 0 (mod \ 4)$	$3k+13 \equiv 1 (mod \ 4)$
$\lambda_i$	$\frac{3k+16}{4}$	$\frac{3k+4}{4}$	$\frac{3k+16}{4}$	$\frac{5k}{4}$	$\frac{3k+20}{4}$	$\frac{3k+8}{4}$	$\frac{5k+6}{4}$	$\frac{5k-4}{4}$	$\frac{5k+8}{4}$	$\frac{3k+12}{4}$
$j$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$	$3k+10 \equiv 2 (mod \ 4)$	$3k+11 \equiv 3 (mod \ 4)$	$3k+12 \equiv 0 (mod \ 4)$	$3k+13 \equiv 1 (mod \ 4)$	$3k+14 \equiv 2 (mod \ 4)$
$\lambda_j$	$\frac{3k+16}{4}$	$\frac{3k+4}{4}$	$\frac{3k+16}{4}$	$\frac{5k}{4}$	$\frac{3k+20}{4}$	$\frac{3k+8}{4}$	$\frac{5k+8}{4}$	$\frac{5k-4}{4}$	$\frac{5k+8}{4}$	$\frac{3k+12}{4}$

| Show Table

DownLoad: CSV

Case 8: ( $n = 8k+7$ with $k\geq 1$ )

Let $A = \{v_1 = a_1, v_3 = a_2\}$ , then

● the number of edges in $v_{1}-a_2$ geodesic is $4$ ,

● the number of edges in $u_{4k+4}-a_1$ geodesic is $k+2$ ,

● the number of edges in $u_{4k+5}-a_1$ geodesic is $k+2$ ,

● the number of edges in $u_{1}-a_2$ geodesic is $3$ ,

● the number of edges in $u_{5k+2}-a_2$ geodesic is $\frac{3k+12}{4} \equiv 2 (mod \ 4)$ ,

● the number of edges in $u_{5k+3}-a_2$ geodesic is $\frac{5k+4}{4} \equiv 3 (mod \ 4)$ .

Moreover, , and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 8.

$\lambda_i$ is the number of edges in a

$v_i-a_1$ geodesic, and

$\lambda_j$ is the number of edges in a

$v_j-a_2$ geodesic.

$i$	$3k+4 \equiv 0 (mod \ 4)$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$	$3k+10 \equiv 2 (mod \ 4)$	$3k+11 \equiv 3 (mod \ 4)$	$3k+12 \equiv 0 (mod \ 4)$	$3k+13 \equiv 1 (mod \ 4)$
$\lambda_i$	$\frac{5k+4}{4}$	$\frac{3k+4}{4}$	$\frac{3k+16}{4}$	$\frac{3k+20}{4}$	$\frac{5k}{4}$	$\frac{3k+8}{4}$	$\frac{3k+8}{4}$	$\frac{5k+12}{4}$	$\frac{5k+8}{4}$	$\frac{5k-4}{4}$
$j$	$4k+2 \equiv 2 (mod \ 4)$	$4k+3 \equiv 3 (mod \ 4)$	$4k+4 \equiv 0 (mod \ 4)$	$4k+5 \equiv 1 (mod \ 4)$	$4k+6 \equiv 2 (mod \ 4)$	$4k+7 \equiv 3 (mod \ 4)$	$4k+8 \equiv 0 (mod \ 4)$	$4k+9 \equiv 1 (mod \ 4)$	$4k+10 \equiv 2 (mod \ 4)$	$4k+11 \equiv 3 (mod \ 4)$
$\lambda_j$	$k+2$	$k$	$k+3$	$k+4$	$k+1$	$k+1$	$k+4$	$k+3$	$k$	$k+2$

| Show Table

DownLoad: CSV

In all of these eight cases, for $y \in N(x)$ , if we denote

● the number of edges in $x-a_1$ geodesic by $\alpha_1$ ,

● the number of edges in $y-a_1$ geodesic by $\beta_1$ ,

● the number of edges in $x-a_2$ geodesic by $\alpha_2$ ,

● the number of edges in $y-a_2$ geodesic by $\beta_2$ ,

then it can be seen that

$\rm{either}\; \; |\alpha_1-\beta_1| = 1\; \; \rm{whenever}\; \; \alpha_2 = \beta_2, \; \; \rm{or}\; \; |\alpha_2 - \beta_2| = 1\; \; \rm{whenever}\; \; \alpha_1 = \beta_1,$

which implies that either $a_1 \in A$ or $a_2 \in A$ adjacently distinguishes the pair $(x, y)$ . Hence, $A$ is a neighbor-distinguishing set for $G$ .

Theorem 4. For $n\geq 9$ , if $G$ is a generalized Petersen graph $P(n, 4)$ , then $dim_a(G) = 2$ .

Proof. Since $dim_a(G) = 1$ if and only if $G$ is a bipartite graph, by Theorem 1. So $dim_a(G)\geq 2$ , because $G$ is not a bipartite graph. Hence, we get the required result, by Theorem 3.

3. Family of generalized Petersen graphs $P(2n, n-1)$

The results of this section provide the solution of the problem of neighbor-distinguishing in the generalized Petersen graphs $P(2n, n-1)$ .

Theorem 5. For all $n\geq 3$ , if $G$ is a generalized Petersen graph $P(2n, n-1)$ , then the set $A = \{u_1, v_{n-1} \}$ is a neighbor-distinguishing set for $G$ .

Proof. According to Proposition 2, we have to perform neighbor-distinguishing for each pair $(x, y)$ , where $x \in V(G)$ and $y \in N(x)$ . When $x \in A$ , then the pair $(x, y)$ adjacently distinguished by $x$ , because the number of edges in $y-x$ geodesic is $1$ while the number of edges in $x-x$ geodesic is $0$ . Further, provides the list of number of edges in $x-u_1$ and $x-v_{n-1}$ geodesics for all $x \in V(G)-A$ .

Table 9. List of the number of edges in

$x-a$ geodesics for

$x \in V(G)-A$ and

$a \in A$ .

Geodesic	The number of edges in the geodesics
When $n = 2k+1$ , $k\geq 1$
For $i$ /geodesics	$u_i- u_1$	$u_i- v_{n-1}$	$v_i- u_1$ $i$ is odd	$v_i- u_1$ $i$ is even	$v_i- v_{n-1}$ $i$ is odd	$v_i- v_{n-1}$ $i$ is even
$1 \leq i \leq k-1$	$i-1$	$i+2$	$i$	$i$	$i+3$	$i+1$
$k \leq i \leq k+1$	$i-1$	$2k-i+1$	$i$	$i$	$2k-i+2$	$2k-i$
$i = k+2$	$\frac{n+1}{2}$	$k-1$	$\frac{n+1}{2}$	$\frac{n+1}{2}$	$2k-i+2$	$2k-i$
$k+3 \leq i \leq 2k$	$2k-i+4$	$2k-i+1$	$2k-i+3$	$2k-i+3$	$2k-i+2$	$2k-i$
$i = 2k+1$	$i-2k+2$	$i-2k+1$	$i-2k+1$	$i-2k+1$	$i-2k+2$	$i-2k+2$
$i = 2k+2$	$4$	$i-n+2$	$3$	$3$	$i-2k$	$i-2k$
$2k+3 \leq i \leq 3k$	$i-2k$	$i-2k+1$	$i-2k-1$	$i-2k-1$	$i-2k+2$	$i-2k$
$i = 3k+1$	$i-2k$	$i-n+1$	$i-n$	$i-n$	$k+2$	$k$
$i = 3k+2$	$\frac{n+1}{2}$	$k$	$i-n$	$i-n$	$k+1$	$k-1$
$3k+3 \leq i \leq 4k$	$2n-i+1$	$4k-i+2$	$2n-i+2$	$2n-i+2$	$4k-i+3$	$4k-i+1$
$i = 2n-1$	$2$	$3$	$3$	$3$	$4$	$4$
$i = 2n$	$1$	$2$	$2$	$2$	$1$	$1$
When $n = 2k$ , $k\geq 2$
$1 \leq i \leq k-2$	$i-1$	$i+2$	$i$	$i$	$i+3$	$i+1$
$i = k-1$	$i-1$	$n-i$	$i$	$i$	$k$	$k$
$k \leq i \leq k+1$	$i-1$	$n-i$	$i$	$i$	$2k-i-1$	$2k-i+1$
$i = k+2$	$i-1$	$n-i$	$\frac{n}{2}$	$\frac{n}{2}$	$n-i-1$	$n-i+1$
$k+3 \leq i \leq 2k-1$	$2k-i+3$	$2k-i$	$2k-i+2$	$2k-i+2$	$2k-i-1$	$2k-i+1$
$i = 2k$	$3$	$2$	$2$	$2$	$3$	$3$
$i = 2k+1$	$4$	$3$	$3$	$3$	$2$	$2$
$2k+2 \leq i \leq 3k-2$	$i-2k+1$	$i-2k+2$	$i-2k$	$i-2k$	$i-2k+1$	$i-2k+3$
$i = 3k-1$	$i-2k+1$	$i-2k+2$	$i-2k$	$i-2k$	$k$	$k$
$3k \leq i \leq 3k+1$	$2n-i+1$	$4k-i$	$i-2k$	$i-2k$	$4k-i+1$	$4k-i-1$
$i = 3k+2$	$k-1$	$k-2$	$\frac{n}{2}$	$\frac{n}{2}$	$4k-i+1$	$4k-i-1$
$3k+3 \leq i \leq 4k-2$	$2n-i+1$	$4k-i$	$2n-i+2$	$2n-i+2$	$4k-i+1$	$4k-i-1$
$i = 2n-1$	$2$	$3$	$3$	$3$	$4$	$4$
$i = 2n$	$1$	$2$	$2$	$2$	$1$	$1$

| Show Table

DownLoad: CSV

Now, for any $y\in N(x)$ , if we denote

● the number of edges in $x-u_1$ geodesic by $\alpha_1$ ,

● the number of edges in $y-u_1$ geodesic by $\beta_1$ ,

● the number of edges in $x-v_{n-1}$ geodesic by $\alpha_2$ ,

● the number of edges in $y-v_{n-1}$ geodesic by $\beta_2$ ,

then it can be seen that

$\rm{either}\; \; |\alpha_1-\beta_1| = 1\; \; \rm{whenever}\; \; \alpha_2 = \beta_2, \; \; \rm{or}\; \; |\alpha_2 - \beta_2| = 1\; \; \rm{whenever}\; \; \alpha_1 = \beta_1,$

which implies that either $u_1 \in A$ or $v_{n-1} \in A$ adjacently distinguishes the pair $(x, y)$ . Hence, $A$ is a neighbor-distinguishing set for $G$ .

Theorem 6. For $n\geq 3$ , if $G$ is a generalized Petersen graph $P(2n, n-1)$ , then $dim_a(G) = 2$ .

Proof. Since $dim_a(G) = 1$ if and only if $G$ is a bipartite graph, by Theorem 1. So $dim_a(G)\geq 2$ , because $G$ is not a bipartite graph. Hence, we get the required result, by Theorem 5.

4. Conclusions

Distinguishing every two vertices in a graph is an eminent problem in graph theory. Many graph theorists have been shown remarkable interest to solve this problem with the aid of distance (the number of edges in a geodesic) from last four decades. Using the technique of finding geodesics between vertices, we solved the problem of distinguishing every two neighbors in generalized Petersen graphs $P(n, 4)$ and $P(2n, n-1)$ . We investigated that, in both the families of generalized Petersen graphs, only two vertices are adequate to distinguish every two neighbors.

Acknowledgments

The authors are grateful to the editor and anonymous referees for their comments and suggestions to improve the quality of this article. This research is supported by Balochistan University of Engineering and Technology Khuzdar, Khuzdar 89100, Pakistan.

Conflict of interest

The authors declare that they have no conflict of interest.

References

[1]	A. Das, P. Das, A. B. Roy, Chaos in a three-dimensional general model of neural network, Int. J. Bifurcation Chaos, 12 (2002), 2271–2281. https://doi.org/10.1142/S0218127402005820 doi: 10.1142/S0218127402005820
[2]	Y. Horikawa, H. Kitajima, H. Matsushita, Fold-pitchfork bifurcation, arnold tongues and multiple chaotic attractors in a minimal network of three sigmoidal neurons, Int. J. Bifurcation Chaos, 28 (2018), 1850123. https://doi.org/10.1142/S0218127418501237 doi: 10.1142/S0218127418501237
[3]	A. Babloyantz, C. Lourenço, Brain chaos and computation, Int. J. Neural Syst., 7 (1996), 461–471. https://doi.org/10.1142/S0129065796000440
[4]	P. Fries, J. H. Reynolds, A. E. Rorie, R. Desimone, Modulation of oscillatory neuronal synchronization by selective visual attention, Science, 291 (2001), 5508. https://doi.org/10.1126/science.1055465 doi: 10.1126/science.1055465
[5]	A. Khadra, X. Z. Liu, X. Shen, Impulsively synchronizing chaotic systems with delay and applications to secure communication, Automatica, 41 (2005), 1491–1502. https://doi.org/10.1016/j.automatica.2005.04.012 doi: 10.1016/j.automatica.2005.04.012
[6]	N. Wang, X. Li, J. Lu, F. E. Alsaadi, Unified synchronization criteria in an array of coupled neural networks with hybrid impulses, IEEE Trans. Neural Networks Learn. Syst., 101 (2018), 25–32. https://doi.org/10.1016/j.neunet.2018.01.017 doi: 10.1016/j.neunet.2018.01.017
[7]	B. Jiang, J. Lu, J. Lou, J. Qiu, Synchronization in an array of coupled neural networks with delayed impulses: average impulsive delay method, Neural Networks, 121 (2020), 452–460. https://doi.org/10.1109/TNNLS.2019.2927249 doi: 10.1109/TNNLS.2019.2927249
[8]	M. Shafiq, I. Ahmad, Robust synchronization of four-dimensional chaotic finance systems with unknown parametric uncertainties, Automatika, 65 (2024), 217–234. https://doi.org/10.1080/00051144.2023.2295204 doi: 10.1080/00051144.2023.2295204
[9]	W. He, T. Luo, Y. Tang, W. Du, Y. C. Tian, F. Qian, Secure communication based on quantized synchronization of chaotic neural networks under an event-triggered strategy, IEEE Trans. Neural Networks Learn. Syst., 31 (2020), 3334–3345. https://doi.org/10.1109/TNNLS.2019.2943548 doi: 10.1109/TNNLS.2019.2943548
[10]	J. J. Xiong, G. B. Zhang, J. X. Wang, T. H. Yan, Improved sliding mode control for finite-time synchronization of nonidentical delayed recurrent neural networks, IEEE Trans. Neural Networks Learn. Syst., 31 (2020), 2209–2216. https://doi.org/10.1109/TNNLS.2019.2927249 doi: 10.1109/TNNLS.2019.2927249
[11]	J. G. Lu, G. Chen, Global asymptotical synchronization of chaotic neural networks by output feedback impulsive control: an LMI approach, Chaos, Solitons Fractals, 41 (2009), 2293–2300. https://doi.org/10.1016/j.chaos.2008.09.024 doi: 10.1016/j.chaos.2008.09.024
[12]	B. Li, Y. Liu, Quasi-synchronization of nonlinear systems with parameter mismatch and time-varying delays via event-triggered impulsive control, AIMS Math., 10 (2025), 3759–3778. https://doi.org/10.3934/math.2025174 doi: 10.3934/math.2025174
[13]	Y. Tang, X. Wu, P. Shi, F. Qian, Input-to-state stability for nonlinear systems with stochastic impulses, Automatica, 13 (2020), 108766. https://doi.org/10.1016/j.automatica.2019.108766 doi: 10.1016/j.automatica.2019.108766
[14]	Z. Xu, D. Peng, X. Li, Synchronization of chaotic neural networks with time delay via distributed delayed impulsive control, Neural Networks, 118 (2019), 332–337. https://doi.org/10.1016/j.neunet.2019.07.002 doi: 10.1016/j.neunet.2019.07.002
[15]	Q. Tang, S. Qu, C. Zhang, Z. Tu, Y. Cao, Effects of impulse on prescribed-time synchronization of switching complex networks, Neural Networks, 174 (2024), 106248. https://doi.org/10.1016/j.neunet.2024.106248 doi: 10.1016/j.neunet.2024.106248
[16]	W. Zhu, D. Wang, L. Liu, G. Feng, Event-based impulsive control of continuous time dynamic systems and its application to synchronization of memristive neural networks, IEEE Trans. Neural Networks Learn., 29 (2018), 3599–3609. https://doi.org/10.1109/TNNLS.2017.2731865 doi: 10.1109/TNNLS.2017.2731865
[17]	Z. W. Liu, G. Wen, X. Yu, Z. H. Guan, T. Huang, Delayed impulsive control for consensus of multiagent systems with switching communication graphs, IEEE Trans. Cybern., 50 (2020), 3045–3055. https://doi.org/10.1109/TCYB.2019.2926115 doi: 10.1109/TCYB.2019.2926115
[18]	X. Lv, X. Li, J. Cao, M. Perc, Dynamical and static multisynchronization of coupled multistable neural networks via impulsive control, Neural Networks Learn. Syst., 529 (2018), 6062–6072. https://doi.org/10.1109/TNNLS.2018.2816924 doi: 10.1109/TNNLS.2018.2816924
[19]	J. Shao, H. Jiang, S. K. Nguang, H. Shen, Impulsive synchronization of coupled delayed neural networks with actuator saturation and its application to image encryption, Neural Networks, 128 (2020), 158–171. https://doi.org/10.1016/j.neunet.2020.05.016 doi: 10.1016/j.neunet.2020.05.016
[20]	W. H. Chen, W. X. Zheng, Exponential stability of nonlinear time delay systems with delayed impulse effects, Automatica, 47 (2011), 1075–1083. https://doi.org/10.1016/j.automatica.2011.02.031 doi: 10.1016/j.automatica.2011.02.031
[21]	X. Li, S. Song, J. Wu, Exponential stability of nonlinear systems with delayed impulses and applications, IEEE Trans. Autom. Control, 64 (2019), 4024–4034. https://doi.org/10.1109/TAC.2019.2905271 doi: 10.1109/TAC.2019.2905271
[22]	B. Jiang, J. Lou, J. Lu, K. Shi, Synchronization of chaotic neural networks: average-delay impulsive control, IEEE Trans. Neural Networks Learn. Syst., 33 (2022), 6007–6012. https://doi.org/10.1109/TNNLS.2021.3069830 doi: 10.1109/TNNLS.2021.3069830
[23]	F. Fan, Y. Xiao, K. Shi, H. Wen, Y. Zhao, $\mu$ -synchronization of coupled neural networks with hybrid delayed and non-delayed impulsive effects, Chaos, Solitons Fractals, 173 (2023), 113620. https://doi.org/10.1016/j.chaos.2023.113620 doi: 10.1016/j.chaos.2023.113620
[24]	X. Li, S. Song, Stabilization of delay systems: delay-dependent impulsive control, IEEE Trans. Autom. Control, 62 (2017), 406–411. https://doi.org/10.1109/TAC.2016.2530041 doi: 10.1109/TAC.2016.2530041
[25]	G. Ballinger, X. Liu, Existence, uniqueness and boundedness results for impulsive delay differential equations, Dyn. Continuous Discrete Impuls. Syst., 74 (2000), 71–93. https://doi.org/10.1080/00036810008840804 doi: 10.1080/00036810008840804
[26]	X. Liu, G. Ballinger, Existence and continuability of solutions for differential equations with delays and state-dependent impulses, Nonlinear Anal. Theory Methods Appl., 51 (2002), 633–647. https://doi.org/10.1109/TAC.2016.2530041 doi: 10.1109/TAC.2016.2530041
[27]	S. Dong, X. Liu, S. Zhong, K. Shi, H. Zhu, Practical synchronization of neural networks with delayed impulses and external disturbance via hybrid control, Neural Networks, 157 (2023), 54–64. https://doi.org/10.1016/j.neunet.2022.09.025 doi: 10.1016/j.neunet.2022.09.025
[28]	A. Wu, H. Liu, Z. Zeng, Observer design and H $\infty$ performance for discrete-time uncertain fuzzy-logic systems, IEEE Trans Cybern., 51 (2021), 2398–2408. https://doi.org/10.1109/TCYB.2019.2948562 doi: 10.1109/TCYB.2019.2948562
[29]	C. Ge, X. Liu, C. Hua, J. H. Park, Exponential synchronization of the switched uncertain neural networks with mixed delays based on sampled-data control, J. Franklin Inst., 54 (2022), 2259–2282. https://doi.org/10.1016/j.neunet.2014.02.008 doi: 10.1016/j.neunet.2014.02.008
[30]	C. Jin, Z. Wang, L. Gong, M. Xiao, G. Jiang, Quasi-synchronization of heterogeneous Lur'e networks with uncertain parameters and impulsive effect, Neurocomputing, 482 (2022), 252–263. https://doi.org/10.1016/j.neucom.2021.11.057 doi: 10.1016/j.neucom.2021.11.057
[31]	W. Huang, Q. Song, Z. Zhao, Y. Liu, F. E. Alsaadi, Robust stability for a class of fractional-order complex-valued projective neural networks with neutral-type delays and uncertain parameters, J. Franklin Inst., 450 (2021), 399–410. https://doi.org/10.1016/j.neucom.2021.04.046 doi: 10.1016/j.neucom.2021.04.046
[32]	F. Chen, W. Zhang, LMI criteria for robust chaos synchronization of a class of chaotic systems, Nonlinear Anal. Theory Methods Appl., 67 (2007), 3384–3393. https://doi.org/10.1016/j.na.2006.10.020 doi: 10.1016/j.na.2006.10.020
[33]	S. Boyd, L. El Ghaoui, E. Feron, V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, Philadelphia, PA, USA: SIAM, 1994. https://doi.org/10.1137/1.9781611970777
[34]	J. Lu, D. W. C. Ho, J. Cao, A unified synchronization criterion for impulsive dynamical networks, Automatica, 46 (2010), 1215–1221. https://doi.org/10.1016/j.automatica.2010.04.005 doi: 10.1016/j.automatica.2010.04.005
[35]	S. Arik, An improved robust stability result for uncertain neural networks with multiple time delays, Neural Networks, 54 (2014), 1–10. https://doi.org/10.1016/j.neunet.2014.02.008 doi: 10.1016/j.neunet.2014.02.008
[36]	H. Fan, J. Tang, K. Shi, Y. Zhao, H. Wen, Delayed impulsive control for $\mu$ -synchronization of nonlinear multi-weighted complex networks with uncertain parameter perturbation and unbounded delays, Mathematics, 599 (2023), 127484. https://doi.org/10.3390/math11010250 doi: 10.3390/math11010250

This article has been cited by:

莉周, Vertex Reducible Edge (Total) Coloring of Two Classes of Generalized Petersen Graph, 2023, 13, 2160-7583, 1851, 10.12677/PM.2023.136188

Reader Comments

Your name:*

Email:*
© 2025 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)