Edge D-Centro Dominating Sets in Graphs

Edge D-Centro Dominating Sets in Graphs

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of physics. Conference series 2021-03, Vol.1770 (1), p.12069
Hauptverfasser: Ananthi, P.Siva, Anto Kinsley, A.
Format: Artikel
Sprache:eng
Schlagworte:
Physics
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 DC eγ (G) is called DC eγ -set of G and some bounds are determined.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1770/1/012069