An Extending Result on Spectral Radius of Bipartite Graphs
Yen-Jen Cheng, F. Fan, Chih-wen Weng
Abstract
Open-access reader
Yen-Jen Cheng, F. Fan, Chih-wen Weng
Abstract
Open-access reader
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.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Mathematics, Bipartite graph, Combinatorics, Spectral radius, Complete bipartite graph, Edge-transitive graph, Graph, Discrete mathematics