On the spectral radius of bipartite graphs with given diameter

✍ Scribed by Mingqing Zhai; Ruifang Liu; Jinlong Shu

• Publisher: Elsevier Science
• Year: 2009
• Tongue: English
• Weight: 123 KB
• Volume: 430
• Category: Article
• ISSN: 0024-3795
• DOI: 10.1016/j.laa.2008.10.011

✦ Synopsis

Let GB(n, d) be the set of bipartite graphs with order n and diam- eter d. This paper characterizes the extremal graph with the maximal spectral radius in GB(n, d). Furthermore, the maximal spectral radius is a decreasing function on d. At last, bipartite graphs with the second largest spectral radius are determined.