On fractional \((k,m)\)-deleted graphs (Q2839676)

Let \(G\) be a graph of order \(n\), and let \(k\geq 1\) and \(m\geq 0\) be two integers.NEWLINEThe definition of a fractional \((k,m)\)-deleted graph is given and it is demonstrated that \(G\) is a fractional \((k,m)\)-deleted graph if NEWLINE\(\delta(G)\geq k+m+\frac{(m+1)^2-3}{4k}\), \(n\geq 4k-3+2(2k+1)m\) NEWLINEand \(\max\{d_G(x),d_G(y)\} \geq \frac{n}{2}\) for each pair of nonadjacent vertices \(x,y\) of \(G\).