Editing Scale-free network (section)

===Immunization===
The question of how to immunize efficiently scale free networks which represent realistic networks such as the Internet and social networks has been studied extensively. One such strategy is to immunize the largest degree nodes, i.e., targeted (intentional) attacks since for this case p<math>c</math> is relatively high and less nodes are needed to be immunized. 
However, in many realistic cases the global structure is not available and the largest degree nodes are not known.

Properties of random graph may change or remain invariant under graph transformations. [[Alireza Mashaghi|Mashaghi A.]] et al., for example, demonstrated that a transformation which converts random graphs to their edge-dual graphs (or line graphs) produces an ensemble of graphs with nearly the same degree distribution, but with degree correlations and a significantly higher clustering coefficient. Scale free graphs, as such, remain scale free under such transformations.<ref name="journals.aps.org">{{cite journal | last1 = Ramezanpour | first1 = A. | last2 = Karimipour | first2 = V. | last3 = Mashaghi | first3 = A. | year = 2003 | title = Generating correlated networks from uncorrelated ones | journal = Phys. Rev. E | volume = 67 | issue = 4| page = 046107 | doi=10.1103/PhysRevE.67.046107| arxiv = cond-mat/0212469 | bibcode = 2003PhRvE..67d6107R | pmid=12786436| s2cid = 33054818 }}</ref>