An extending result on spectral radius of bipartite graphs

DOI10.11650/TJM/8145zbMATH Open1401.05180arXiv1509.07586OpenAlexW2962725341MaRDI QIDQ1990377FDOQ1990377

Authors: Yen-Jen Cheng, Feng-lei Fan, Chih-Wen Weng 

Publication date: 25 October 2018

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Abstract: Let $G$ denote 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$ and $e+1$ are not twin primes. We determine 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.

Full work available at URL: https://arxiv.org/abs/1509.07586

Recommendations

• Spectral radius of bipartite graphs
• On the spectral radius of bipartite graphs with given diameter
• On the spectral radius of bipartite graphs which are nearly complete
• On the spectral radius of bipartite graphs
• On the spectral radius of bipartite graphs

zbMATH Keywords

spectral radiustwin primes

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Extremal problems in graph theory (05C35)

Cites Work

• On the spectral radius of (0,1)-matrices
• Bounded gaps between primes
• On the first eigenvalue of bipartite graphs
• Spectral radius and signless Laplacian spectral radius of strongly connected digraphs
• A sharp upper bound on the signless Laplacian spectral radius of graphs
• Spectral characterizations of two families of nearly complete bipartite graphs
• On the largest eigenvalues of bipartite graphs which are nearly complete
• Sharp upper bounds on the spectral radius of graphs
• Spectral radius and degree sequence of a graph
• Rearrangements of square matrices with non-negative elements
• Sharp upper bounds on the distance spectral radius of a graph
• Sharp bounds on the spectral radius of a nonnegative matrix
• Spectral radius of bipartite graphs
• Sharp bounds for the spectral radius of nonnegative matrices
• Spectral radius and average 2-degree sequence of a graph

Cited In (5)

• On the spectral radius of bipartite graphs which are nearly complete
• Counterexamples of the Bhattacharya-Friedland-Peled conjecture
• Spectral radius of bipartite graphs
• Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size
• Maximizing spectral radius and number of spanning trees in bipartite graphs

This page was built for publication: An extending result on spectral radius of bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1990377)