本文主要研究内容
作者（2019）在《Pining Control Algorithm for Complex Networks》一文中研究指出：In this paper, we quote the concept of resistance distance for Pinning control, and discuss the relationship between the upper bound of the minimum eigenvalue of the grounded Laplacian Matrix and the
Abstract
In this paper, we quote the concept of resistance distance for Pinning control, and discuss the relationship between the upper bound of the minimum eigenvalue of the grounded Laplacian Matrix and the
论文参考文献
[1].Decentralized Laplacian Eigenvalues Estimation for Networked Multi-Agent Systems[A]. Mauro Franceschelli,Andrea Gasparri,Alessandro Giua,Carla Seatzu.Proceedings of Joint 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference（5）[C]. 2009[2].The unicyclic graphs with extremal signless Laplacian spectral spread[A]. Shi-Cai Gong School of Science,Zhejiang A & F University,Hangzhou,311300,P.R.China Guang-Hui Xu School of Science,Zhejiang A & F University,Hangzhou,311300,P.R.China.Proceedings of 2011 World Congress on Engineering and Technology(CET 2011) VOL01[C]. 2011[3].The Effect on the Signless Laplacian Spectral Radius of a Graph by Subdividing or Grafting Edges[A]. Kun-fu Fang,Guang-Hui Xu,Jin-long Shu.Proceeding of the Sixth International Conference of Matrices and Operators Volume 1[C]. 2011[4].Normalized Laplacian Eigenvalues of Graphs[A]. Shaowei Sun.Proceedings of 2016 Workshop 1[C]. 2016[5].New bound of the Nordhaus-Gaddum type of the Laplacian matrix of graphs[A]. Wang Tianfei 1,Li Bin 2,Zou Jin 1,Jia Liping 1,Sun Feng 11 School of Mathematics and Information Science Leshan Normal University Leshan,China2 School of Computer Science Leshan Normal University Leshan,China.Proceedings of 2011 World Congress on Engineering and Technology(CET 2011) VOL02[C]. 2011[6].An Explicit Formula for Differences Between Laplacian-Eigenvector Components Using Coalesced Graphs[A]. Sandip Roy,Yan Wan.Proceedings of Joint 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference（4）[C]. 2009[7].Comparison of Graph Sampling Algorithms Using Normalized Laplacian Spectra[A]. Bo Jiao,Chengdong Huang,Yuanping Nie,Fei Huang,Ying Zhou,Jing Du.Proceedings of 2016 IEEE 7th International Conference on Software Engineering and Service Science（ICSESS 2016）[C]. 2016[8].On the Laplacian spectral characterization of some unicyclic graphs[A]. Shengbiao Hu Department of Mathematics,Qinghai Nationalities University,Xining 810007,P.R.China.Proceedings of 2011 World Congress on Engineering and Technology(CET 2011) VOL01[C]. 2011[9].On the existence of positive solutions of nth-order m-point boundary value problems with p-Laplacian operator[A]. Chunmei Yuan College of Physics and Mathematics,Changzhou University,Changzhou,China,213164 Shixia Luan School of Mathematical Sciences,Qufu Normal University,Qufu,China,273165 Hua Zhou College of Physics and Mathematics,Changzhou University,Changzhou,China,213164 Bo Li College of Physics and Mathematics,Changzhou University,Changzhou,China,213164.Proceedings of 2012 International Conference on Computer Science and Mathematics,Physical Education and Management（ICCMPE 2012）[C]. 2012[10].Laplacian Spectral Characterization of The Corona Cn°2K1[A]. Jiang Zhou,Hong-bo Li,Chang-jiang Bu.Proceeding of the Sixth International Conference of Matrices and Operators Volume 2[C]. 2011
论文详细介绍
论文作者分别是来自第三十八届中国控制会议的，发表于刊物第三十八届中国控制会议2019-07-27论文，是一篇关于,第三十八届中国控制会议2019-07-27论文的文章。本文可供学术参考使用，各位学者可以免费参考阅读下载，文章观点不代表本站观点，资料来自第三十八届中国控制会议2019-07-27论文网站，若本站收录的文献无意侵犯了您的著作版权，请联系我们删除。
标签：第三十八届中国控制会议2019-07-27论文;
：Pining Control Algorithm for Complex Networks论文
下载Doc文档