Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: fractional global domination number

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Fractional global domination in graphs

100%

Arumugam S., Karuppasamy K., Hamid I.

Discussiones Mathematicae Graph Theory

2010

tom 30

nr 1

33-44

Let G = (V,E) be a graph. A function g:V → [0,1] is called a global dominating function (GDF) of G, if for every v ∈ V, $g(N[v]) = ∑_{u ∈ N[v]}g(u) ≥ 1$ and $g(\overline{N(v)}) = ∑_{u ∉ N(v)}g(u) ≥ 1$. A GDF g of a graph G is called minimal (MGDF) if for all functions f:V → [0,1] such that f ≤ g and f(v) ≠ g(v) for at least one v ∈ V, f is not a GDF. The fractional global domination number $γ_{fg}(G)$ is defined as follows: $γ_{fg}(G)$ = min{|g|:g is an MGDF of G } where $|g| = ∑_{v ∈ V} g(v)$. In this paper we initiate a study of this parameter.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Arumugam S.

1 Hamid I.

1 Karuppasamy K.

1 2010

Wyniki wyszukiwania

Fractional global domination in graphs