Journal article Open Access

Further Results on Dual Domination in Graphs

V.Lavanya; D. S. T. Ramesh; N.Meena

Sponsor(s)
Blue Eyes Intelligence Engineering & Sciences Publication (BEIESP)

Let G = (V, E) be a simple graph. A set S V(G) is a dual dominating set of G (or bi-dominating set of G) if S is a dominating set of G and every vertex in S dominates exactly two vertices in V-S. The dual-domination number γdu(G) (or bi-domination number G bi  ) of a graph G is the minimum cardinality of the minimal dual dominating set (or dual dominating set). In this paper dual domination number and relation with other graph parameters are determined.

Files (481.9 kB)
Name Size
C5588029320.pdf
md5:9d6efd41eef19c24ce60f44ec33eb7fc
481.9 kB Download
9
7
views
downloads
Views 9
Downloads 7
Data volume 3.4 MB
Unique views 6
Unique downloads 7

Share

Cite as