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 the normal view instead:
scientific article; zbMATH DE number 5850020
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A necessary and sufficient eigenvector condition for a connected graph to be bipartite |
scientific article; zbMATH DE number 5850020 |
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
0.8875644
0 references
0.8717751
0 references
0.86564577
0 references
0 references
0.8643647
0 references
0 references
0.8622895
0 references
