Secure point set domination in graphs
Künye
Gupta, P. & Goyal, A. (2024). Secure point set domination in graphs. TWMS Journal Of Applied And Engineering Mathematics, 14(2), 605-617.Özet
In this paper, we introduce the notion of secure point-set domination in graphs. A point-set dominating D of graph G is called a secure point-set dominating set if for every vertex u ? V ?D, there exists a vertex v ? D?N(u) such that (D?{v})?{u} is also a point-set dominating set of G. The minimum cardinality of a secure point-set dominating set is called secure point-set domination number of graph G and will be denoted by ?spsd(G) (or simply ?spsd). For any graph G of order n, ?spsd(G) ? 1 and equality holds if and only if G ?= Kn. Also, for any graph G of order n, ?spsd(G) ? n – 1 and equality holds if and only if G ?= K1,n?1. Here we characterize graphs G with ?spsd(G) = 2. We also establish a family F of 11 graphs such that being F-free is necessary as well as sufficient for a graph G to satisfy ?spsd(G) = n ? 2.
Cilt
14Sayı
2Bağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/5954https://jaem.isikun.edu.tr/web/index.php/current/124-vol14no2/1200
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir:
İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
Total roman domination number of graphs
Thakkar, Dineshbhai; Badiyani, Sanket (Işık University Press, 2022)In this paper a characterization of minimal total roman dominating functions has been proved. It has also been proved that if v is a pendant vertex and its neighbor u is not a pendant vertex then f(v) = 0 or 1 for any ... -
Global color class domination partition of a graph
Swaminathan, Venkatasubramanian; Praba, Venkatrengan (Işık University Press, 2019)Color class domination partition was suggested by E. Sampathkumar and it was studied in [1]. A proper color partition of a finite, simple graph G is called a color class domination partition (or cd-partition) if every color ... -
Graphs with equal domination and independent domination number
Vaidya, Samir K.; Pandit, R. M. (Işık University Press, 2015)A set S of vertices of a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. The independent domination number of G, denoted by i(G), is the ...