Open AccessVertex control of flows in networks
Author(s) -
KlausJochen Engel,
Marjeta Kramar Fijavž,
Rainer Nagel,
Eszter Sikolya
Publication year - 2008
Publication title -
networks and heterogeneous media
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.732
H-Index - 34
eISSN - 1556-181X
pISSN - 1556-1801
DOI - 10.3934/nhm.2008.3.709
Subject(s) - vertex (graph theory) , mathematics , computer science , combinatorics , graph
We study a transport equation in a network and control it in a single vertex. We describe all possible reachable states and prove a criterion of Kalman type for those vertices in which the problem is maximally controllable. The results are then applied to concrete networks to show the complexity of the problem.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom