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


Laplacian spectral characterization of 3-rose graphs
Authors:Fenjin Liu  Qiongxiang Huang
Institution:1. College of Science, Chang?an University, Xi?an, Shaanxi, 710064, PR China;2. College of Mathematics and System Science, Xinjiang University, Urumqi, 830046, PR China
Abstract:A 3-rose graph is a graph consisting of three cycles intersecting in a common vertex, J. Wang et al. showed all 3-rose graphs with at least one triangle are determined by their Laplacian spectra. In this paper, we complete the above Laplacian spectral characterization and prove that all 3-rose graphs are determined by their Laplacian spectra.
Keywords:05C50
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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