科研之友
微信
新浪微博
Facebook
分享链接
摘要
A book is a connected graph in which all induced cycles have a unique edge in common. We determine the unique graphs with the largest spectral radius among all books with n vertices, among all books with n vertices and k cycles, and among all books with n vertices and k pendant vertices, respectively.
- 出版日期2018-4
