Fixed node determination and analysis in directed acyclic graphs of structured networks

DOI10.1016/j.jfranklin.2024.106995zbMATH Open1543.93025MaRDI QIDQ6593712

Yeong-Ung Kim, Nam Jin Park, Hyo-Sung Ahn

Publication date: 27 August 2024

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

zbMATH Keywords

directed acyclic graphsfixed nodesnetwork controllabilityfixed controllable subspace

Mathematics Subject Classification ID

Controllability (93B05) Linear systems in control theory (93C05) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• The directed subgraph homeomorphism problem
• Shortest path algorithms for nearly acyclic directed graphs
• Generic properties and control of linear structured systems: A survey
• Graph minors. XIII: The disjoint paths problem
• Sampled-data based structural controllability of multi-agent systems with switching topology
• A dynamic graph characterisation of the fixed part of the controllable subspace of a linear structured system
• On the fixed controllable subspace in linear structured systems
• Graph Distances and Controllability of Networks
• Upper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents
• On the generic dimension of controllable subspaces
• Determination of generic dimensions of controllable subspaces and its application
• Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
• Finding the k Shortest Paths
• On the Structural and Strong Structural Controllability of Undirected Networks
• Structural controllability
• Strong structural controllability and observability of individual nodes: a graph-theoretical approach

This page was built for publication: Fixed node determination and analysis in directed acyclic graphs of structured networks