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


Ordering graphs with cut edges by their spectral radii
Authors:Kun-fu Fang
Institution:Kun-fu FANG Faculty of Science, Huzhou Teachers College, Huzhou 313000, China
Abstract:Let Gnk\mathcal{G}_n^k denote a set of graphs with n vertices and k cut edges. In this paper, we obtain an orderof the first four graphs in Gnk\mathcal{G}_n^k in terms of their spectral radii for $6 \leqslant k \leqslant \tfrac{{n - 2}} {3}$6 \leqslant k \leqslant \tfrac{{n - 2}} {3}.
Keywords:spectral radius  cut edge  ordering  eigenvalue
本文献已被 CNKI 维普 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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