Edge D-Centro Dominating Sets in Graphs. Issue 1 (March 2021)

• Record Type: Journal Article
• Authors: Ananthi, P.Siva; Anto Kinsley, A.
• Is Part Of: Journal of physics. Volume 1770:Issue 1(2021)
• Publication Date: 2021-03
• Subjects: Physics -- Congresses; 530.5
• DOI: 10.1088/1742-6596/1770/1/012069
• Languages: English
• ISSNs: 1742-6588

Abstract

Abstract: A subset S ⊂ E(G) of a graph G is said to be Edge D-centro dominating set of G, if for every e ∈ E – S, there exists an edge f in S such that D(e, f) = Rad e (G). The minimum cardinality of the Edge D-centro dominating set is called Edge D-centro domination number, denoted by (G). The Edge D-centro dominating set with cardinality DCeγ (G) is called DCeγ -set of G and some bounds are determined.