r = assortativity(g) find assortative coefficient. r = 1 indicate perfect 
maxing and r = 0 means there is no assortative maxing. minimun value of 
r 0 is -1. Random graph tend to negative side. 
 
[r, e] = assortativity(g) returns assortative maxing matrix E. 
 
Ref: M. E. Newman 2003, Maxing pattern in network 
 
Systems Biology and Evolution Toolbox (SBEToolbox). 
Authors: Kranti Konganti, James Cai. 
(C) Texas A&M University. 
 
$LastChangedDate: 2012-05-29 22:49:45 -0500 (Tue, 29 May 2012) $ 
$LastChangedRevision: 80 $ 
$LastChangedBy: konganti $