Spectral radius of bipartite graphs
檔案
本條目沒有附加檔案。
日期
2015-06-01
類型
系所
期刊名稱
LINEAR ALGEBRA AND ITS APPLICATIONS
卷期與頁次
第 474 卷,頁 30–43
ISSN
0024-3795
語言
英文
摘要
Let k, p, q be positive integers with k < p < q + 1. We prove that the maximum spectral radius of a simple bipartite graph obtained from the complete bipartite graph K-p,K-q of bipartition orders p and q by deleting k edges is attained when the deleted edges are all incident on a common vertex which is located in the partite set of order q. Our method is based on new sharp upper bounds on the spectral radius of bipartite graphs in terms of their degree sequences. (C) 2015 Elsevier Inc. All rights reserved.