The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs (Q1356465): Difference between revisions

For any graph \(G\), a real-valued function \(g:V(G)\to [0,1]\) is called a dominating function if for every \(v\in V(G)\), we have \(\sum_{w\in N[v]}g(w)\geq 1\), where \(N[v]\) denotes the neighbourhood of \(v\) together with \(v\) itself. The fractional domination number is defined to be \[ \gamma_f(G)= \min\biggl\{\sum_{v\in V(G)}g(v)\mid g\text{ is a dominating function of }G\biggr\}. \] The bondage number of \(\gamma_f\), denoted by \(b_f(G)\), is defined to be the minimum cardinality of a set of edges whose removal from \(G\) results in a graph \(G'\) satisfying \(\gamma_f(G')> \gamma_f(G)\). The reinforcement number of \(\gamma_f(G)\), denoted \(r_f(G)\), is defined to be the minimum cardinality of a set of edges which when added to \(G\) results in a graph \(G''\) satisfying \(\gamma_f(G'')< \gamma_f(G)\). Exact values for \(b_f(G)\) and \(r_f(G)\) are given for some classes of graphs.