Zobrazeno 1 - 10
of 2 082
pro vyhledávání: '"algebraic connectivity"'
Publikováno v:
AIMS Mathematics, Vol 9, Iss 9, Pp 25689-25704 (2024)
We consider the controllability of multi-agent dynamical systems modeled by a particular class of bipartite graphs, called chain graphs. Our main focus is related to chain graphs with exactly one repeated degree. We determine all chain graphs with th
Externí odkaz:
https://doaj.org/article/36544eef66c44393baf3fb0b80093217
Publikováno v:
Mathematics Interdisciplinary Research, Vol 9, Iss 2, Pp 185-197 (2024)
Consider a simple, undirected graph $ G=(V,E)$, where $A$ represents the adjacency matrix and $Q$ represents the Laplacian matrix of $G$. The second smallest eigenvalue of Laplacian matrix of $G$ is called the algebraic connectiv
Externí odkaz:
https://doaj.org/article/5dae8c54c90d43058510a679a6eab331
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
The Approach of k-Leader Selection in Undirected Graphs on Maximizing the Consensus Convergence Rate
Publikováno v:
IEEE Access, Vol 12, Pp 175640-175646 (2024)
This paper undertakes an in-depth study and detailed analysis of the problem of the optimal selection of k leaders for a first-order leader-follower multi-agent system (MAS) whose interaction topology is an undirected graph, with the aim of achieving
Externí odkaz:
https://doaj.org/article/2150e385b2bc4a17b4e37fdad6cd6682
Autor:
Bilal Ahmad Rather
Publikováno v:
Mathematics, Vol 12, Iss 14, p 2175 (2024)
The power graph P(Zn) of Zn for a finite cyclic group Zn is a simple undirected connected graph such that two distinct nodes x and y in Zn are adjacent in P(Zn) if and only if x≠y and xi=y or yi=x for some non-negative integer i. In this article, w
Externí odkaz:
https://doaj.org/article/00d6f56eed79457990f9094e4488ffe0