On the average lower bondage number of a graph

Turaci, Tufan

RAIRO - Operations Research - Recherche Opérationnelle, Special issue - Advanced Optimization Approaches and Modern OR-Applications, Tome 50 (2016) no. 4-5, pp. 1003-1012.

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=\left(V\right(G),E(G\left)\right)$ be a simple graph. The bondage number $b\left(G\right)$ 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}\left(G\right)=\frac{1}{\left|E\right(G\left)\right|}{\Sigma }_{e\in E\left(G\right)}{b}_e\left(G\right)$, where the lower bondage number, denoted by $b_e\left(G\right)$, 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.

V. Aytac, Average Lower Domination Number in Graphs. C. R. Acad. Bulgare Sci. 65 (2012) 1665–1674. | MR | Zbl

A. Aytac and T. Turaci, Vertex Vulnerability Parameter of Gear Graphs. Int. J. Found. Comput. Sci. 22 (2011) 1187–1195. | DOI | MR | Zbl

A. Aytac, Z.N. Odabas and T. Turaci, The Bondage Number of Some Graphs. C. R. Acad. Bulgare Sci. 64 (2011) 925–930. | MR | Zbl

A. Aytac, T. Turaci and Z.N. Odabas, On The Bondage Number of Middle Graphs. Math. Notes 93 (2013) 803–811. | DOI | MR | Zbl

C.A. Barefoot, B. Entringer and H. Swart, Vulnerability in graphs-a comparative survey. J. Combin. Math. Combin. Comput. 1 (1987) 13–22. | MR | Zbl

D. Bauer, F. Harary, J. Nieminen and C.L. Suffel, Domination alteration sets in graph. Disc. Math. 47 (1983) 153–161. | DOI | MR | Zbl

L.W. Beineke, O.R. Oellermann and R.E. Pippert, The Average Connectivity of a Graph. Disc. Math. 252 (2002) 31–45. | DOI | MR | Zbl

M. Blidia, M. Chellali and F. Maffray, On Average Lower Independence and Domination Number in Graphs. Disc. Math. 295 (2005) 1–11. | DOI | MR | Zbl

V. Chvatal, Tough graphs and Hamiltonian circuits. Disc. Math. 5 (1973) 215–228. | DOI | MR | Zbl

J.F. Fink, M.S. Jacobson, L.F. Kinch and J. Roberts, The bondage number of a graph. Disc. Math. 86 (1990) 47–57. | DOI | MR | Zbl

H. Frank and I.T. Frisch, Analysis and design of survivable Networks. IEEE Trans. Commun. Technol. 18 (1970) 501–519. | DOI | MR

I. Gutman, Distance of Thorny Graphs. Publ. Institut Math. (Nouvelle Série) 63 (1998) 31–36. | MR | Zbl

D.F. Hartnell and D.F. Rall, Bounds on the bondage number of a graph. Disc. Math. 128 (1994) 173–177. | DOI | MR | Zbl

T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundementals of Domination in Graphs. Advanced Topic. Marcel Dekker, Inc., New York (1998). | MR | Zbl

M.A. Henning, Trees with Equal Average Domination and Independent Domination Numbers. Ars Combinatoria 71 (2004) 305–318. | MR | Zbl

M.A. Henning and O.R. Oellermann, The Average Connectivity of a Digraph. Discrete Appl. Math. 140 (2004) 143–153. | DOI | MR | Zbl

I. Mishkovski, M. Biey and L. Kocarev, Vulnerability of complex Networks. Commun. Nonlinear Sci. Numer. Simul. 16 (2011) 341–349. | DOI | MR | Zbl

K.T. Newport and P.K. Varshney, Design of survivable communication networks under performance constraints. IEEE Trans. Reliab. 40 (1991) 433–440. | DOI | Zbl

U. Teschner, New results about the bondage number of a graph. Disc. Math. 171 (1997) 249–259. | DOI | MR | Zbl