Fractional edge domination in graphs | Zendy

S. Arumugam | Zendy; Sithara Jerry | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Fractional edge domination in graphs

Author(s) -

S. Arumugam,

Sithara Jerry

Publication year - 2009

Publication title -

applicable analysis and discrete mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.69

H-Index - 26

eISSN - 2406-100X

pISSN - 1452-8630

DOI - 10.2298/aadm0902359a

Subject(s) - mathematics , combinatorics , neighbourhood (mathematics) , dominating set , graph , enhanced data rates for gsm evolution , function (biology) , discrete mathematics , mathematical analysis , vertex (graph theory) , computer science , telecommunications , evolutionary biology , biology

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research