A necessary and sufficient eigenvector condition for a connected graph to be bipartite
ELA. The Electronic Journal of Linear Algebra, Tome 20 (2010), pp. 351-353.

Voir la notice de l'article dans Electronic Library of Mathematics

Summary: We give a necessary and sufficient condition for a graph to be bipartite in terms of an eigenvector corresponding to the largest eigenvalue of the adjacency matrix of the graph.
Classification : 05C50, 15A18
Mots-clés : graph, bipartite, principal eigenvector, independent set 
@article{EEJLA_2010__20__a28,
     author = {Cioaba, Sebastian M.},
     title = {A necessary and sufficient eigenvector condition for a connected graph to be bipartite},
     journal = {ELA. The Electronic Journal of Linear Algebra},
     pages = {351--353},
     publisher = {mathdoc},
     volume = {20},
     year = {2010},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/item/EEJLA_2010__20__a28/}
}
TY  - JOUR
AU  - Cioaba, Sebastian M.
TI  - A necessary and sufficient eigenvector condition for a connected graph to be bipartite
JO  - ELA. The Electronic Journal of Linear Algebra
PY  - 2010
SP  - 351
EP  - 353
VL  - 20
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/EEJLA_2010__20__a28/
LA  - en
ID  - EEJLA_2010__20__a28
ER  - 
%0 Journal Article
%A Cioaba, Sebastian M.
%T A necessary and sufficient eigenvector condition for a connected graph to be bipartite
%J ELA. The Electronic Journal of Linear Algebra
%D 2010
%P 351-353
%V 20
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/EEJLA_2010__20__a28/
%G en
%F EEJLA_2010__20__a28
Cioaba, Sebastian M. A necessary and sufficient eigenvector condition for a connected graph to be bipartite. ELA. The Electronic Journal of Linear Algebra, Tome 20 (2010), pp. 351-353. https://geodesic-test.mathdoc.fr/item/EEJLA_2010__20__a28/