On the public citation graph

A necessary and sufficient condition for the controllability of single-leader multi-chain systems

0 signed · 48 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4613-0163-9openalex-snapshot
Algebraic Graph Theory
inferredcites →https://doi.org/10.1016/0005-1098(86)90039-7openalex-snapshot
Linear system theory and design
inferredcites →https://doi.org/10.1016/j.sysconle.2010.01.006openalex-snapshot
Leader-following consensus of multi-agent systems under fixed and switching topologies
inferredcites →https://doi.org/10.1023/b:jota.0000042524.57088.8bopenalex-snapshot
Multiple-Spacecraft Reconfiguration Through Collision Avoidance, Bouncing, and Stalemate
inferredcites →https://doi.org/10.1109/acc.2006.1656409openalex-snapshot
On the controlled agreement problem
inferredcites →https://doi.org/10.1109/cdc.2004.1428782openalex-snapshot
On the controllability of nearest neighbor interconnections
inferredcites →https://doi.org/10.1109/cdc.2011.6160658openalex-snapshot
Controllability of diffusively-coupled multi-agent systems with general and distance regular coupling topologies
inferredcites →https://doi.org/10.1109/mcs.2012.2195411openalex-snapshot
Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks?
inferredcites →https://doi.org/10.1109/tac.2003.812781openalex-snapshot
Coordination of groups of mobile autonomous agents using nearest neighbor rules
inferredcites →https://doi.org/10.1109/tac.2003.816954openalex-snapshot
Distributed control design for spatially interconnected systems
inferredcites →https://doi.org/10.1109/tac.2004.841121openalex-snapshot
Necessary and sufficient graphical conditions for formation control of unicycles
inferredcites →https://doi.org/10.1109/tac.2005.864190openalex-snapshot
Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
inferredcites →https://doi.org/10.1109/tac.2006.872826openalex-snapshot
A Decomposition Approach to Distributed Control of Spatially Invariant Systems
inferredcites →https://doi.org/10.1109/tac.2008.919548openalex-snapshot
Controllability of a Leader–Follower Dynamic Network With Switching Topology
inferredcites →https://doi.org/10.1109/tac.2011.2168912openalex-snapshot
On the Reachability and Observability of Path and Cycle Graphs
inferredcites →https://doi.org/10.1109/tac.2012.2208314openalex-snapshot
A Class of Uncontrollable Diffusively Coupled Multiagent Systems with Multichain Topologies
inferredcites →https://doi.org/10.1109/tac.2013.2241493openalex-snapshot
Controllability and Observability of Grid Graphs via Reduction and Symmetries
inferredcites →https://doi.org/10.1109/tac.2013.2259992openalex-snapshot
On the Controllability Properties of Circulant Networks
inferredcites →https://doi.org/10.1137/060674909openalex-snapshot
Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
inferredcites →https://doi.org/10.1137/s0363012903428652openalex-snapshot
Coordination and Geometric Optimization via Distributed Dynamical Systems
inferredcites →https://doi.org/10.1201/b11629openalex-snapshot
Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs
inferredcites →https://doi.org/10.1504/ijscc.2010.031160openalex-snapshot
Controllability analysis of multi-agent systems using relaxed equitable partitions
inferredcites →https://doi.org/10.1504/ijscc.2012.045932openalex-snapshot
Comments on 'Controllability analysis of multi-agent systems using relaxed equitable partitions'

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rnc.3798openalex-snapshot
Controllability of multi‐agent systems under directed topology
inferred← citeshttps://doi.org/10.1002/rnc.3870openalex-snapshot
Controllability of multiagent systems based on path and cycle graphs
inferred← citeshttps://doi.org/10.1002/rnc.3986openalex-snapshot
Further on the controllability of networked MIMO LTI systems
inferred← citeshttps://doi.org/10.1002/rnc.4772openalex-snapshot
Controllability of heterogeneous multiagent systems
inferred← citeshttps://doi.org/10.1007/s11432-018-9450-8openalex-snapshot
Graph partitions and the controllability of directed signed networks
inferred← citeshttps://doi.org/10.1016/j.automatica.2019.108597openalex-snapshot
Controllability of Kronecker product networks
inferred← citeshttps://doi.org/10.1016/j.ifacol.2017.08.062openalex-snapshot
Controllable Graphs with Small Sums of Diameters and Maximum Vertex Degrees
inferred← citeshttps://doi.org/10.1016/j.ifacol.2020.12.1666openalex-snapshot
Laplacian Controllability of a Class of Non-Simple Ring Graphs
inferred← citeshttps://doi.org/10.1016/j.sysconle.2017.07.015openalex-snapshot
Constructing a controllable graph under edge constraints
inferred← citeshttps://doi.org/10.1049/iet-cta.2018.5484openalex-snapshot
Laplacian controllable graphs based on connecting two antiregular graphs
inferred← citeshttps://doi.org/10.1049/iet-cta.2018.5875openalex-snapshot
Minimal Laplacian controllability problems of threshold graphs
inferred← citeshttps://doi.org/10.1049/iet-cta.2018.6214openalex-snapshot
Generalising Laplacian controllability of paths
inferred← citeshttps://doi.org/10.1063/5.0226760openalex-snapshot
Selection and optimization of drive nodes in drive-response networks
inferred← citeshttps://doi.org/10.1093/imamci/dnz026openalex-snapshot
Data-sampling controllability of multi-agent systems
inferred← citeshttps://doi.org/10.1109/allerton.2019.8919877openalex-snapshot
Minimum Laplacian controllability of graphs based on interconnecting two classes of threshold graphs
inferred← citeshttps://doi.org/10.1109/cac.2017.8242800openalex-snapshot
The controllability of weighted and directed networks with antagonistic interactions
inferred← citeshttps://doi.org/10.1109/coase.2018.8560603openalex-snapshot
On a class of multi-input laplacian controllable graphs
inferred← citeshttps://doi.org/10.1109/lcsys.2021.3135350openalex-snapshot
Minimal Laplacian Controllability of Directed Threshold Graphs
inferred← citeshttps://doi.org/10.1109/tac.2020.2992444openalex-snapshot
Laplacian Dynamics on Cographs: Controllability Analysis Through Joins and Unions
inferred← citeshttps://doi.org/10.1109/tcns.2019.2947589openalex-snapshot
Laplacian Controllability of Interconnected Graphs
inferred← citeshttps://doi.org/10.1109/tcns.2021.3124907openalex-snapshot
Controllability of Heterogeneous Networked Systems With Nonidentical Inner-Coupling Matrices
inferred← citeshttps://doi.org/10.1109/tnse.2021.3074037openalex-snapshot
Observability of Heterogeneous Multi-Agent Systems
inferred← citeshttps://doi.org/10.3929/ethz-b-000381682openalex-snapshot
Laplacian dynamics on cographs: Controllability analysis through joins and unions
inferred← citeshttps://doi.org/10.48550/arxiv.1807.00479openalex-snapshot
Perfectly Controllable Multi-Agent Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1902.05671openalex-snapshot
Generalizing Laplacian Controllability of Paths
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.