Published February 29, 2020
| Version v1
Journal article
Open
Further Results on Dual Domination in Graphs
Creators
- 1. Research Scholar, Department of Mathematics, Nazareth Margoschis College, Pillaiyanmanai,Thoothukudi-628617, Affiliated to Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli-627 012, TamilNadu, India.
- 2. Department of Mathematics, Nazareth Margoschis College, Pillaiyanmanai,Thoothukudi-628617, Affiliated to Manonmaniainm Sundaranar University, Abishekapatti, Tirunelveli-627 012, TamilNadu, India
- 3. Department of Mathematics, The M.D.T Hindu College, Pettai, Tirunelveli- 627010,, Affiliated to Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli-627012, TamilNadu, India
Contributors
- 1. Publisher
Description
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
C5588029320.pdf
Files
(481.9 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:9d6efd41eef19c24ce60f44ec33eb7fc
|
481.9 kB | Preview Download |
Additional details
Related works
- Is cited by
- Journal article: 2249-8958 (ISSN)
Subjects
- ISSN
- 2249-8958
- Retrieval Number
- C5588029320/2020©BEIESP