Skip to main content
Log in

Incompatibility networks as models of scale-free small-world graphs

  • Interdisciplinary Physics
  • Published:
The European Physical Journal B Aims and scope Submit manuscript

Abstract.

We make a mapping from Sierpinski fractals to a new class of networks, the incompatibility networks, which are scale-free, small-world, disassortative, and maximal planar graphs. Some relevant characteristics of the networks such as degree distribution, clustering coefficient, average path length, and degree correlations are computed analytically and found to be peculiarly rich. The method of network representation can be applied to some real-life systems making it possible to study the complexity of real networked systems within the framework of complex network theory.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhongzhi Zhang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, Z., Zhou, S., Zou, T. et al. Incompatibility networks as models of scale-free small-world graphs. Eur. Phys. J. B 60, 259–264 (2007). https://doi.org/10.1140/epjb/e2007-00344-7

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1140/epjb/e2007-00344-7

PACS.

Navigation