Geodesic
On the first eigenvalue of bipartite graphs
The electronic journal of combinatorics, Tome 15 (2008)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl arXiv EuDML
In this paper we study the maximum value of the largest eigenvalue for simple bipartite graphs, where the number of edges is given and the number of vertices on each side of the bipartition is given. We state a conjectured solution, which is an analog of the Brualdi-Hoffman conjecture for general graphs, and prove the conjecture in some special cases.
DOI : 10.37236/868
Classification : 05C50, 05C07, 05C35, 15A18
Mots-clés : largest eigenvalue, simple bipartite graphs, analog of the Brualdi-Hoffman conjecture for general graphs 
Amitava Bhattacharya; Shmuel Friedland; Uri N. Peled. On the first eigenvalue of bipartite graphs. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/868
@article{10_37236_868,
     author = {Amitava Bhattacharya and Shmuel Friedland and Uri N. Peled},
     title = {On the first eigenvalue of bipartite graphs},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/868},
     zbl = {1178.05061},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/868/}
}
TY  - JOUR
AU  - Amitava Bhattacharya
AU  - Shmuel Friedland
AU  - Uri N. Peled
TI  - On the first eigenvalue of bipartite graphs
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/868/
DO  - 10.37236/868
ID  - 10_37236_868
ER  - 
%0 Journal Article
%A Amitava Bhattacharya
%A Shmuel Friedland
%A Uri N. Peled
%T On the first eigenvalue of bipartite graphs
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/868/
%R 10.37236/868
%F 10_37236_868

Cité par Sources :