首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1篇
  数学   1篇
  2011年   1篇
排序方式: 共有1条查询结果,搜索用时 12 毫秒
1
1.
Let D(G)=(di,j)n×n denote the distance matrix of a connected graph G with order n, where dij is equal to the distance between vi and vj in G. The largest eigenvalue of D(G) is called the distance spectral radius of graph G, denoted by ?(G). In this paper, we give some graft transformations that decrease and increase ?(G) and prove that the graph (obtained from the star Sn on n (n is not equal to 4, 5) vertices by adding an edge connecting two pendent vertices) has minimal distance spectral radius among unicyclic graphs on n vertices; while (obtained from a triangle K3 by attaching pendent path Pn−3 to one of its vertices) has maximal distance spectral radius among unicyclic graphs on n vertices.  相似文献
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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