A necessary and sufficient eigenvector condition for a connected graph to be bipartite.
ELA. The Electronic Journal of Linear Algebra [electronic only] (2010)
- Volume: 20, page 351-353
- ISSN: 1081-3810
Access Full Article
top
How to cite
topCioaba, Sebastian M.. "A necessary and sufficient eigenvector condition for a connected graph to be bipartite.." ELA. The Electronic Journal of Linear Algebra [electronic only] 20 (2010): 351-353. <http://eudml.org/doc/228239>.
@article{Cioaba2010,
author = {Cioaba, Sebastian M.},
journal = {ELA. The Electronic Journal of Linear Algebra [electronic only]},
keywords = {graph; bipartite; principal eigenvector; independent set},
language = {eng},
pages = {351-353},
publisher = {ILAS - The International Linear Algebra Society c/o Daniel Hershkowitz, Department of Mathematics, Technion - Israel Institute of Techonolgy},
title = {A necessary and sufficient eigenvector condition for a connected graph to be bipartite.},
url = {http://eudml.org/doc/228239},
volume = {20},
year = {2010},
}
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 [electronic only]
PY - 2010
PB - ILAS - The International Linear Algebra Society c/o Daniel Hershkowitz, Department of Mathematics, Technion - Israel Institute of Techonolgy
VL - 20
SP - 351
EP - 353
LA - eng
KW - graph; bipartite; principal eigenvector; independent set
UR - http://eudml.org/doc/228239
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.