The Vulnerability of Some Networks including Cycles via Domination Parameters

Tufan Turaci and Hüseyin Aksan

Journal of Optimization, 2016, vol. 2016, 1-8

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.

Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/7179/2016/4705493.pdf (application/pdf)
http://downloads.hindawi.com/journals/7179/2016/4705493.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjopti:4705493

DOI: 10.1155/2016/4705493

Access Statistics for this article

More articles in Journal of Optimization from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().