首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Laplacian spectral characterization of disjoint union of paths and cycles
Authors:JF Wang  SK Simić  QX Huang  EM Li Marzi
Institution:1. Department of Mathematics , Qinghai Normal University , Xining, Qinghai 810008, P.R. China;2. College of Mathematics and System Science , Xinjiang University , Urumqi 830046, P.R. China;3. Mathematical Institute SANU , Knez Mihailova 36, Belgrade 11 001, Serbia;4. College of Mathematics and System Science , Xinjiang University , Urumqi 830046, P.R. China;5. Department of Mathematics , University of Messina , 98166 Sant'Agata, Messina, Italy
Abstract:The Laplacian spectrum of a graph consists of the eigenvalues (together with multiplicities) of the Laplacian matrix. In this article we determine, among the graphs consisting of disjoint unions of paths and cycles, those ones which are determined by the Laplacian spectrum. For the graphs, which are not determined by the Laplacian spectrum, we give the corresponding cospectral non-isomorphic graphs.
Keywords:Laplacian spectrum  cospectral graphs  spectral characterization  spectral determination
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号