A necessary and sufficient eigenvector condition for a connected graph to be bipartite (Q3075146)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A necessary and sufficient eigenvector condition for a connected graph to be bipartite |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A necessary and sufficient eigenvector condition for a connected graph to be bipartite |
scientific article |
Statements
A necessary and sufficient eigenvector condition for a connected graph to be bipartite (English)
0 references
10 February 2011
0 references
graph
0 references
bipartite
0 references
principal eigenvector
0 references
independent set
0 references
