標題: Spectral radius of bipartite graphs
作者: Liu, Chia-an
Weng, Chih-wen
應用數學系
Department of Applied Mathematics
關鍵字: Bipartite graph;Adjacency matrix;Spectral radius;Degree sequence
公開日期: 1-六月-2015
摘要: 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.
URI: http://dx.doi.org/10.1016/j.laa.2015.01.040
http://hdl.handle.net/11536/124795
ISSN: 0024-3795
DOI: 10.1016/j.laa.2015.01.040
期刊: LINEAR ALGEBRA AND ITS APPLICATIONS
Volume: 474
起始頁: 30
結束頁: 43
顯示於類別:期刊論文