The Exact Controllability of the Molecular Graph Networks
Joint Authors
Wei, Liang
Deng, Bo
Ye, Zhonglin
Li, Faxu
Zhao, Haixing
Source
Issue
Vol. 2019, Issue 2019 (31 Dec. 2019), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2019-11-30
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
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 C3, C4, or K4, 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 ND, the exact controllability of these networks is obtained.
Moreover, we give the minimum driver node sets of partial small networks.
American Psychological Association (APA)
Wei, Liang& Li, Faxu& Zhao, Haixing& Deng, Bo& Ye, Zhonglin. 2019. The Exact Controllability of the Molecular Graph Networks. Journal of Chemistry،Vol. 2019, no. 2019, pp.1-7.
https://search.emarefa.net/detail/BIM-1171337
Modern Language Association (MLA)
Wei, Liang…[et al.]. The Exact Controllability of the Molecular Graph Networks. Journal of Chemistry No. 2019 (2019), pp.1-7.
https://search.emarefa.net/detail/BIM-1171337
American Medical Association (AMA)
Wei, Liang& Li, Faxu& Zhao, Haixing& Deng, Bo& Ye, Zhonglin. The Exact Controllability of the Molecular Graph Networks. Journal of Chemistry. 2019. Vol. 2019, no. 2019, pp.1-7.
https://search.emarefa.net/detail/BIM-1171337
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1171337