Content deleted Content added
No edit summary |
|||
Line 11:
== Bipartitioning a graph with the eigenvector ==
How does one "use the eigenvector with the smallest eigenvalue to bipartition the graph"? Is there another article to which we could link that would provide those details? --[[Special:Contributions/76.27.96.159|76.27.96.159]] ([[User talk:76.27.96.159|talk]]) 04:29, 10 December 2008 (UTC)
== Example ==
Hm, there is no "Figures 1-7"
[[Special:Contributions/129.27.201.116|129.27.201.116]] ([[User talk:129.27.201.116|talk]])
|