An extending result on spectral radius of bipartite graphs

Yen Jen Cheng*, Feng Lei Fan, Chih-wen Weng

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


In this paper, we study the spectral radius of bipartite graphs. Let G be a bipartite graph with e edges without isolated vertices. It was known that the spectral radius of G is at most the square root of e, and the upper bound is attained if and only if G is a complete bipartite graph. Suppose that G is not a complete bipartite graph and (e-1,e+1) is not a pair of twin primes. We describe the maximal spectral radius of G. As a byproduct of our study, we obtain a spectral characterization of a pair (e-1,e+1) of integers to be a pair of twin primes.

Original languageEnglish
Pages (from-to)263-274
Number of pages12
JournalTaiwanese Journal of Mathematics
Issue number2
StatePublished - 1 Apr 2018


  • Spectral radius
  • Twin primes


Dive into the research topics of 'An extending result on spectral radius of bipartite graphs'. Together they form a unique fingerprint.

Cite this