An Extending Result on Spectral Radius of Bipartite Graphs
Yen-Jen Cheng, Feng-lei Fan, Chih-wen Weng
Source abstract
In this paper, we study the spectral radius of bipartite graphs. Let be a bipartite graph with edges without isolated vertices. It was known that the spectral radius of is at most the square root of , and the upper bound is attained if and only if is a complete bipartite graph. Suppose that is not a complete bipartite graph and is not a pair of twin primes. We describe the maximal spectral radius of . As a byproduct of our study, we obtain a spectral characterization of a pair of integers to be a pair of twin primes.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.