  Networks with a scale-free degree distribution are widely thought to promote
cooperation in various games. Herein, by studying the well-known prisoner's
dilemma game, we demonstrate that this need not necessarily be true. For the
very same degree sequence and degree distribution, we present a variety of
possible behaviour. We reassess the perceived importance of hubs in a network
towards the maintenance of cooperation. We also reevaluate the dependence of
cooperation on network clustering and assortativity.
