No comfort here, except in company, but I've been having the same problem with IE in the last few days to a hair-pulling-out degree .-- Mothperson 17 : 09, 26 Jun 2005 ( UTC)
12.
It is interesting that for a chain graph and a weak densely connected graph, both of which have very different in and out degree distributions; the formulation of Liu et al . would predict same values of { n _ \ mathrm { D } }.
13.
In a Directed graph, in-assortativity ( r ( \ text { in }, \ text { in } ) ) and out-assortativity ( r ( \ text { out }, \ text { out } ) ) measure the tendencies of nodes to connect with other nodes that have similar in and out degrees as themselves, respectively.
