Integral graph: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

29 May 2012

  • curprev 04:3504:35, 29 May 2012Vipul talk contribs 231 bytes +231 Created page with "{{undirected graph property}} ==Definition== A finite undirected graph is termed an '''integral graph''' if all the (complex) eigenvalues of its [[characteristic polynom..."