Abstract
Given an ensemble of random graphs with a specific degree distribution, we show that the transformation which converts these graphs to their line (edge-dual) graphs produces an ensemble of graphs with nearly the same degree distribution, but with degree correlations and a much higher clustering coefficient. We also study the percolation properties of these new graphs.
- Received 19 December 2002
DOI:https://doi.org/10.1103/PhysRevE.67.046107
©2003 American Physical Society