FRACTIONAL EDGE DOMINATION IN GRAPHS

Let $G=(V,E)$ be a graph. A function $f:E ightarrow [0,1]$ iscalled an {it edge dominating function} if $sumlimits_{xin N[e]}f(x)geq 1$ for all $ein E(G),$where $N[e]$ is the closed neighbourhood of the edge $e.$ An edge dominating function $f$ is calledminimal (MEDF) if for all functions $g:E ightarrow [0,1]$ with $g Keywords edge dominating function --- edge irredundant function --- edge independent function