Exponential Domination Critical and Stability in Some Graphs
Makaleler > Tam Makale · 2019
Yazarlar: Aysun AYTAÇ, Betul Atay Atakul
International Journal of Foundations of Computer Science, SCI Expanded İndekslerine Giren Dergi, Uluslararası, Wos, 2019, cilt 30, ss 781-791
DOI: 10.1142/s0129054119500217
Özet
An exponential dominating set of graph [Formula: see text] is a kind of distance domination subset [Formula: see text] such that [Formula: see text], [Formula: see text], where [Formula: see text] is the length of a shortest path in [Formula: see text] if such a path exists, and [Formula: see text] otherwise. The minimum exponential domination number, [Formula: see text] is the smallest cardinality of an exponential dominating set. The minimum exponential domination number, [Formula: see text] can be decreased or increased by removal of some vertices from [Formula: see text]. In this paper, we investigate of this phenomenon which is referred to critical and stability in graphs.