×

On the average lower bondage number of a graph. (English) Zbl 1353.05095

Summary: The domination number is an important subject that it has become one of the most widely studied topics in graph theory, and also is the most often studied property of vulnerability of communication networks. 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. Let \(G = (V(G),E(G))\) be a simple graph. The bondage number \(b(G)\) of a nonempty graph \(G\) is the smallest number of edges whose removal from \(G\) result in a graph with domination number greater than that of \(G\). If we think a graph as a modeling of network, the average lower bondage number of a graph is a new measure of the graph vulnerability and it is defined by \(b_{av}(G) = \frac{1}{|E(G)|} \sum_{e\in E(G)}b_e(G)\), where the lower bondage number, denoted by \(b_e(G)\), of the graph \(G\) relative to \(e\) is the minimum cardinality of bondage set in \(G\) that contains the edge \(e\). In this paper, the above mentioned new parameter has been defined and examined. Then upper bounds, lower bounds and exact formulas have been obtained for any graph \(G\). Finally, the exact values have been determined for some well-known graph families.

MSC:

05C69 Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C40 Connectivity
68M10 Network design and communication in computer systems
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] V. Aytac, Average Lower Domination Number in Graphs. C. R. Acad. Bulgare Sci.65 (2012) 1665-1674. · Zbl 1313.05202
[2] A. Aytac and T. Turaci, Vertex Vulnerability Parameter of Gear Graphs. Int. J. Found. Comput. Sci.22 (2011) 1187-1195. · Zbl 1226.68070
[3] A. Aytac, Z.N. Odabas and T. Turaci, The Bondage Number of Some Graphs. C. R. Acad. Bulgare Sci.64 (2011) 925-930. · Zbl 1265.05325
[4] A. Aytac, T. Turaci and Z.N. Odabas, On The Bondage Number of Middle Graphs. Math. Notes93 (2013) 803-811. · Zbl 1269.05086
[5] C.A. Barefoot, B. Entringer and H. Swart, Vulnerability in graphs-a comparative survey. J. Combin. Math. Combin. Comput.1 (1987) 13-22. · Zbl 0646.05042
[6] D. Bauer, F. Harary, J. Nieminen and C.L. Suffel, Domination alteration sets in graph. Disc. Math.47 (1983) 153-161. · Zbl 0524.05040
[7] L.W. Beineke, O.R. Oellermann and R.E. Pippert, The Average Connectivity of a Graph. Disc. Math.252 (2002) 31-45. · Zbl 1002.05040
[8] M. Blidia, M. Chellali and F. Maffray, On Average Lower Independence and Domination Number in Graphs. Disc. Math.295 (2005) 1-11. · Zbl 1066.05099
[9] V. Chvatal, Tough graphs and Hamiltonian circuits. Disc. Math.5 (1973) 215-228. · Zbl 0256.05122
[10] J.F. Fink, M.S. Jacobson, L.F. Kinch and J. Roberts, The bondage number of a graph. Disc. Math.86 (1990) 47-57. · Zbl 0745.05056
[11] H. Frank and I.T. Frisch, Analysis and design of survivable Networks. IEEE Trans. Commun. Technol.18 (1970) 501-519.
[12] I. Gutman, Distance of Thorny Graphs. Publ. Institut Math. (Nouvelle Série)63 (1998) 31-36. · Zbl 0942.05021
[13] D.F. Hartnell and D.F. Rall, Bounds on the bondage number of a graph. Disc. Math.128 (1994) 173-177. · Zbl 0796.05051
[14] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundementals of Domination in Graphs. Advanced Topic. Marcel Dekker, Inc., New York (1998).
[15] M.A. Henning, Trees with Equal Average Domination and Independent Domination Numbers. Ars Combinatoria71 (2004) 305-318. · Zbl 1081.05085
[16] M.A. Henning and O.R. Oellermann, The Average Connectivity of a Digraph. Discrete Appl. Math.140 (2004) 143-153. · Zbl 1047.05024
[17] I. Mishkovski, M. Biey and L. Kocarev, Vulnerability of complex Networks. Commun. Nonlinear Sci. Numer. Simul.16 (2011) 341-349. · Zbl 1221.91043
[18] K.T. Newport and P.K. Varshney, Design of survivable communication networks under performance constraints. IEEE Trans. Reliab.40 (1991) 433-440. · Zbl 0729.90944
[19] U. Teschner, New results about the bondage number of a graph. Disc. Math.171 (1997) 249-259. · Zbl 0881.05067
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.