Online citations, reference lists, and bibliographies.

Fractional Global Domination In Graphs

S. Arumugam, K. Karuppasamy, I. S. Hamid
Published 2010 · Mathematics, Computer Science

Cite This
Download PDF
Analyze on Scholarcy
Share
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 2 V; g(N[v]) = P u2N[v] g(u) 1 and g(N(v)) = P u= 2N(v) g(u) 1. A GDF g of a
This paper references



This paper is referenced by
Semantic Scholar Logo Some data provided by SemanticScholar