IDEAS home Printed from https://ideas.repec.org/a/spr/eurphb/v60y2007i2p259-264.html
   My bibliography  Save this article

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

Author

Listed:
  • Zhongzhi Zhang

    ()

  • Shuigeng Zhou

    ()

  • Tao Zou
  • Lichao Chen
  • Jihong Guan

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. Copyright EDP Sciences/Società Italiana di Fisica/Springer-Verlag 2007

Suggested Citation

  • Zhongzhi Zhang & Shuigeng Zhou & Tao Zou & Lichao Chen & Jihong Guan, 2007. "Incompatibility networks as models of scale-free small-world graphs," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 60(2), pages 259-264, November.
  • Handle: RePEc:spr:eurphb:v:60:y:2007:i:2:p:259-264
    DOI: 10.1140/epjb/e2007-00344-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1140/epjb/e2007-00344-7
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chen, Renxia & Fu, Xinchu & Wu, Qingchu, 2012. "On topological properties of the octahedral Koch network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(3), pages 880-886.
    2. Knor, Martin & Škrekovski, Riste, 2013. "Deterministic self-similar models of complex networks based on very symmetric graphs," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(19), pages 4629-4637.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:eurphb:v:60:y:2007:i:2:p:259-264. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.