1. Spectral radius of bipartite graphs.
- Author
-
Liu, Chia-an and Weng, Chih-wen
- Subjects
- *
BIPARTITE graphs , *INTEGERS , *MATHEMATICAL bounds , *DEGREES of freedom , *GEOMETRIC vertices - Abstract
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 , 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. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF