Scale Free Networks, Scientific American, May 2003
There was a great article in Scientific American on Scale-Free Networks a while back in May 2003 written by Albert-Laszlo Barabasi and Eric Bonabeau.
If you read up on Network Theory, you’ll find that most texts assume that large networks are random graphs. This is a wrong assumption.
Many of the most interesting characteristics in graph theory is a result of the underlying architecture of scale-free networks.
I highly recommend this article so it’s worth a stop at the public library. I have that magazine so you could ask me too. 