×

The vulnerability of some networks including cycles via domination parameters. (English) Zbl 1509.05164

Summary: Let \(G = (V(G), E(G))\) 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, \(k\)-pyramids, and \(n\)-gon books, via domination parameters. Then, exact solutions of the domination parameters are obtained for the above-mentioned graphs.

MSC:

05C82 Small world graphs, complex networks (graph-theoretic aspects)
05C69 Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C40 Connectivity
90B10 Deterministic network models in operations research
90B18 Communication networks in operations research
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Mishkovski, I.; Biey, M.; Kocarev, L., Vulnerability of complex networks, Communications in Nonlinear Science and Numerical Simulation, 16, 1, 341-349, (2011) · Zbl 1221.91043
[2] Newport, K. T.; Varshney, P. K., Design of survivable communications networks under performance constraints, IEEE Transactions on Reliability, 40, 4, 433-440, (1991) · Zbl 0729.90944
[3] Turaci, T.; Ökten, M., The edge eccentric connectivity index of hexagonal cactus chains, Journal of Computational and Theoretical Nanoscience, 12, 10, 3977-3980, (2015)
[4] Turaci, T.; Okten, M., Vulnerability of Mycielski graphs via residual closeness, Ars Combinatoria, 118, 419-427, (2015) · Zbl 1349.05195
[5] Aslan, E., Neighbour isolated scattering number of graphs, ScienceAsia, 41, 6, 423-431, (2015)
[6] Turaci, T., On the average lower bondage number a graph, RAIRO-Operations Research, (2015) · Zbl 1353.05095
[7] Frank, H.; Frisch, I. T., Analysis and design of survivable networks, IEEE Transactions on Communications, 18, 501-519, (1970)
[8] Chvátal, V., Tough graphs and Hamiltonian circuits, Discrete Mathematics, 5, 215-228, (1973) · Zbl 0256.05122
[9] Barefoot, C. A.; Entringer, R.; Swart, H., Vulnerability in graphs-a comparative survey, Journal of Combinatorial Mathematics and Combinatorial Computing, 1, 13-22, (1987) · Zbl 0646.05042
[10] Bauer, D.; Harary, F.; Nieminen, J.; Suffel, C. L., Domination alteration sets in graphs, Discrete Mathematics, 47, 153-161, (1983) · Zbl 0524.05040
[11] Haynes, T. W.; Hedeniemi, S. T.; Slater, P. J., Fundamentals of Domination in Graphs, (1998), New York, NY, USA: Advanced Topic, Marcel Dekker, New York, NY, USA · Zbl 0890.05002
[12] Aytaç, A.; Turaci, T.; Odabaş, Z. N., On the bondage number of middle graphs, Mathematical Notes, 93, 5-6, 795-801, (2013) · Zbl 1269.05086
[13] Aytaç, A.; Odabas, Z. N.; Turaci, T., The bondage number of some graphs, Comptes Rendus de Lacademie Bulgare des Sciences, 64, 7, 925-930, (2011) · Zbl 1265.05325
[14] Chellali, M., Bounds on the 2-domination number in cactus graphs, Opuscula Mathematica, 26, 1, 5-12, (2006) · Zbl 1133.05066
[15] Krzywkowski, M., 2-bondage in graphs, International Journal of Computer Mathematics, 90, 7, 1358-1365, (2013) · Zbl 1273.05163
[16] Aytaç, A.; Turaci, T., Vertex vulnerability parameter of gear graphs, International Journal of Foundations of Computer Science, 22, 5, 1187-1195, (2011) · Zbl 1226.68070
[17] Henning, M. A., Trees with equal average domination and independent domination numbers, Ars Combinatoria, 71, 305-318, (2004) · Zbl 1081.05085
[18] Aytaç, V., Average lower domination number in graphs, Comptes Rendus de Lacademie Bulgare des Sciences, 65, 12, 1665-1674, (2012) · Zbl 1313.05202
[19] Beineke, L. W.; Oellermann, O. R.; Pippert, R. E., The average connectivity of a graph, Discrete Mathematics, 252, 1–3, 31-45, (2002) · Zbl 1002.05040
[20] Aslan, E., The average lower connectivity of graphs, Journal of Applied Mathematics, 2014, (2014) · Zbl 1406.05053
[21] Odabaş, Z. N.; Aytaç, A., Residual closeness in cycles and related networks, Fundamenta Informaticae, 124, 3, 297-307, (2013) · Zbl 1311.68017
[22] Blidia, M.; Chellali, M.; Maffray, F., On average lower independence and domination numbers in graphs, Discrete Mathematics, 295, 1–3, 1-11, (2005) · Zbl 1066.05099
[23] Turaci, T., The concept of vulnerability in graphs and average lower 2-domination number, Proceedings of the 28th National Mathematic Conference
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.