Sunday, November 9, 2008

left out on previous post

Forgot to say that the author has also mastered the proof that for a k-regular graph.
K will be its largest eigenvalue with multiplicity 1 and all one vector as its eigenvector
Posted by at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)