Results 61 to 70 of about 4,527 (99)
Paths, cycles and related partitioning problems in graphs
, 2017 Zan-Bo Zhang
semanticscholar +1 more source
The positional power of nodes in digraphs. [PDF]
Herings, P. Jean-Jacques +2 more
core +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Bounding the Chromatic Number of Dense Digraphs by Arc Neighborhoods
Combinatorica, 2023The chromatic number of a directed graph is the minimum number of induced acyclic subdigraphs that cover its vertex set, and accordingly, the chromatic number of a tournament is the minimum number of transitive subtournaments that cover its vertex set ...
Felix Klingelhoefer, Alantha Newman
semanticscholar +1 more source
Distributed finite‐time optimization algorithms for multi‐agent systems under directed graphs
International Journal of Robust and Nonlinear Control, 2023Existing distributed finite‐time optimization algorithms for continuous‐time multi‐agent systems require either undirected graphs or weight balanced digraphs, and distributed finite‐time optimization problems for weight unbalanced digraphs are still ...
Wenbo Zhu, Changyin Sun, Qingling Wang
semanticscholar +1 more source
IEEE Transactions on Neural Networks and Learning Systems, 2022
The time-varying output bipartite formation containment (TVOBFC) problem for linear multiagent systems (MASs) under directed graphs is an important problem.
Juan Zhang +3 more
semanticscholar +1 more source
The time-varying output bipartite formation containment (TVOBFC) problem for linear multiagent systems (MASs) under directed graphs is an important problem.
Juan Zhang +3 more
semanticscholar +1 more source
IEEE Transactions on Cybernetics, 2021
The issue of bipartite time-varying formation (BTVF) tracking for linear multiagent systems (MASs) with a leader of unknown input on signed digraphs is investigated.
Chenhang Yan +3 more
semanticscholar +1 more source
The issue of bipartite time-varying formation (BTVF) tracking for linear multiagent systems (MASs) with a leader of unknown input on signed digraphs is investigated.
Chenhang Yan +3 more
semanticscholar +1 more source
IEEE Transactions on Network Science and Engineering, 2021
This work deals with the analysis and protocol design problems of the prescribed-time interval bipartite consensus of multi-agent systems on signed and directed graphs.
Xin Gong +4 more
semanticscholar +1 more source
This work deals with the analysis and protocol design problems of the prescribed-time interval bipartite consensus of multi-agent systems on signed and directed graphs.
Xin Gong +4 more
semanticscholar +1 more source
Well-Quasi-Ordering Eulerian Digraphs Embeddable in Surfaces by Strong Immersion
arXiv.orgWe prove that for every surface $\Sigma$, the class of Eulerian directed graphs that are Eulerian embeddable into $\Sigma$ (in particular they have degree at most $4$) is well-quasi-ordered by strong immersion. This result marks one of the most versatile
Dario Cavallaro +2 more
semanticscholar +1 more source