E-resources
-
Mousavi, Shima Sadat; Haeri, Mohammad; Mesbahi, Mehran
IEEE transactions on automatic control, 03/2021, Volume: 66, Issue: 3Journal Article
In this article, we examine the controllability of Laplacian dynamic networks on cographs. Cographs appear in modeling a wide range of networks and include as special instances, the threshold graphs. In this article, we present necessary and sufficient conditions for the controllability of cographs, and provide an efficient method for selecting a minimal set of input nodes from which the network is controllable. In particular, we define a sibling partition in a cograph and show that the network is controllable if all nodes of any cell of this partition except one are chosen as control nodes. The key ingredient for such characterizations is the intricate connection between the modularity of cographs and their modal properties. Finally, we use these results to characterize the controllability conditions for certain subclasses of cographs.
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|
Source: Personal bibliographies
and: SICRIS
The material is available in full text. If you wish to order the material anyway, click the Continue button.