Counterexamples of the Bhattacharya-Friedland-Peled conjecture
From MaRDI portal
Publication:2669191
Abstract: The Brauldi-Hoffman conjecture, proved by Rowlinson in 1988, characterized the graph with maximal spectral radius among all simple graphs with prescribed number of edges. In 2008, Bhattacharya, Friedland, and Peled proposed an analog, which will be called the BFP conjecture in the following, of the Brauldi-Hoffman conjecture for the bipartite graphs with fixed numbers of edges in the graph and vertices in the bipartition. The BFP conjecture was proved to be correct if the number of edges is large enough by several authors. However, in this paper we provide some counterexamples of the BFP conjecture.
Recommendations
Cites work
- A bound on the spectral radius of graphs with \(e\) edges
- An extending result on spectral radius of bipartite graphs
- Bounds on the spectral radius of graphs with e edges
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- On the first eigenvalue of bipartite graphs
- On the largest eigenvalues of bipartite graphs which are nearly complete
- On the maximal index of graphs with a prescribed number of edges
- On the spectral radius of (0,1)-matrices
- Spectral characterizations of two families of nearly complete bipartite graphs
- Spectral radius of bipartite graphs
Cited in
(5)
This page was built for publication: Counterexamples of the Bhattacharya-Friedland-Peled conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669191)