2017Taiwanese Journal of MathematicsOpen access

An Extending Result on Spectral Radius of Bipartite Graphs

Yen-Jen Cheng, F. Fan, Chih-wen Weng

Open full text 4 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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

Related papers

Back to paper searchBrowse research topicsOriginal source
An Extending Result on Spectral Radius of Bipartite Graphs — Research Paper | ScholarLens