Spectral radius of bipartite graphs
| Autor: | Chih-wen Weng, Chia An Liu |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
Discrete mathematics
Numerical Analysis Algebra and Number Theory Dense graph Foster graph Complete bipartite graph 05C50 15A18 law.invention Combinatorics Edge-transitive graph law Triangle-free graph Line graph FOS: Mathematics Bipartite graph Mathematics - Combinatorics Discrete Mathematics and Combinatorics Cograph Combinatorics (math.CO) Geometry and Topology Mathematics |
| Zdroj: | Linear Algebra and its Applications. 474:30-43 |
| ISSN: | 0024-3795 |
| DOI: | 10.1016/j.laa.2015.01.040 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect