Spectral radius of bipartite graphs

Chia An Liu*, Chih-wen Weng

*此作品的通信作者

研究成果: Article同行評審

5 引文 斯高帕斯(Scopus)

摘要

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 Kp,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.

原文English
頁(從 - 到)30-43
頁數14
期刊Linear Algebra and Its Applications
474
DOIs
出版狀態Published - 1 六月 2015

指紋

深入研究「Spectral radius of bipartite graphs」主題。共同形成了獨特的指紋。

引用此