Constructing a controllable graph under edge constraints
type: Item
instance of: scholarly article
title: Constructing a controllable graph under edge constraints
zbMATH Open document ID: 1376.93022
author: Shun-Pin Hsu
published in: Systems \& Control Letters
publication date: 2017-11-16T00:00:00Z
Mathematics Subject Classification ID: 93B05
Mathematics Subject Classification ID: 68T42
Mathematics Subject Classification ID: 94C15
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 6807694
zbMATH Keywords: controllability
zbMATH Keywords: multi-agent systems
zbMATH Keywords: threshold graph
zbMATH Keywords: path graph
MaRDI profile type: Publication
full work available at URL: j.sysconle.2017.07.015
OpenAlex ID: W2752891763
cites work: Q3580272
cites work: Multi-agent machine learning: a reinforcement approach
cites work: Interconnection topologies for multi-agent coordination under leader-follower framework
cites work: Necessary and sufficient graphical conditions for formation control of unicycles
cites work: Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
cites work: Controllability of a Leader–Follower Dynamic Network With Switching Topology
cites work: Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
cites work: Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks?
cites work: A Class of Uncontrollable Diffusively Coupled Multiagent Systems with Multichain Topologies
cites work: Upper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents
cites work: On the Reachability and Observability of Path and Cycle Graphs
cites work: A necessary and sufficient condition for the controllability of single-leader multi-chain systems
cites work: Controllability and Observability of Grid Graphs via Reduction and Symmetries
cites work: On the Controllability Properties of Circulant Networks
cites work: Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs
cites work: Zero forcing parameters and minimum rank problems
cites work: Zero forcing number, constrained matchings and strong structural controllability
cites work: Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
cites work: Antiregular graphs are universal for trees
cites work: Laplacian controllability classes for threshold graphs
cites work: Controllability of the multi-agent system modeled by the threshold graph with one repeated degree
cites work: Degree maximal graphs are Laplacian integral
cites work: Q2716030
cites work: Q3114100
cites work: Graph Controllability Classes for the Laplacian Leader-Follower Dynamics
cites work: Q4902474
DOI: 10.1016/J.SYSCONLE.2017.07.015
description: scientific article; zbMATH DE number 6807694