Exact controllability of a star-type network

Wu, Lihui; Zhou, Jianjiang; Yuan, Zhengzhong; Cai, Jianping

doi:10.1109/ccdc.2015.7162849

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Yuan et al [11] proves that the number of driver nodes of a network is equal to the maximum geometric multiplicity and gives a method to solve the minimum set of driver nodes. In [12], Wu et al constructs a star-type network and gives its characteristic polynomial, which directly expresses the exact controllability of this kind of complex networks. Furthermore, research on controllability of multilayer networks and fractal networks, which is common in the chemical system, has some results [13,14].…”

Section: Introductionmentioning

confidence: 99%

The Exact Controllability of the Molecular Graph Networks

Wei

Zhao

et al. 2019

Journal of Chemistry

View full text Add to dashboard Cite

In this paper, we mainly study the exact controllability of several types of extended-path molecular graph networks. Based on the construction of extended-path molecular graph networks with C 3 , C 4 , or K 4 , using the determinant operation of the matrix and the recursive method, the exact characteristic polynomial of these networks is deduced. According to the definition of minimum driver node number N D , the exact controllability of these networks is obtained. Moreover, we give the minimum driver node sets of partial small networks.

show abstract