IDEAS home Printed from https://ideas.repec.org/a/hin/jjopti/4705493.html
   My bibliography  Save this article

The Vulnerability of Some Networks including Cycles via Domination Parameters

Author

Listed:
  • Tufan Turaci
  • Hüseyin Aksan

Abstract

Let be an undirected simple connected graph. A network is usually represented by an undirected simple graph where vertices represent processors and edges represent links between processors. Finding the vulnerability values of communication networks modeled by graphs is important for network designers. The vulnerability value of a communication network shows the resistance of the network after the disruption of some centers or connection lines until a communication breakdown. The domination number and its variations are the most important vulnerability parameters for network vulnerability. Some variations of domination numbers are the 2-domination number, the bondage number, the reinforcement number, the average lower domination number, the average lower 2-domination number, and so forth. In this paper, we study the vulnerability of cycles and related graphs, namely, fans, -pyramids, and -gon books, via domination parameters. Then, exact solutions of the domination parameters are obtained for the above-mentioned graphs.

Suggested Citation

  • Tufan Turaci & Hüseyin Aksan, 2016. "The Vulnerability of Some Networks including Cycles via Domination Parameters," Journal of Optimization, Hindawi, vol. 2016, pages 1-8, June.
    • Handle: RePEc:hin:jjopti:4705493
    DOI: 10.1155/2016/4705493
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/7179/2016/4705493.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/7179/2016/4705493.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2016/4705493?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Ersin Aslan, 2014. "The Average Lower Connectivity of Graphs," Journal of Applied Mathematics, Hindawi, vol. 2014, pages 1-4, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      More about this item

      Statistics

      Access and download statistics

      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:hin:jjopti:4705493. See general information about how to correct material in RePEc.

      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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

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

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.