Congruent dominating sets in a graph - a new concept
Künye
Vaidya, S. K. & Vadhel, H. D. (2023). Congruent dominating sets in a graph - a new concept. TWMS Journal Of Applied And Engineering Mathematics, 13(4), 1658-1668.Özet
A dominating set D ? V (G) is said to be a congruent dominating set of G if ?v?V (G) d(v) ? 0 ( mod ?v?D d(v) ). The minimum cardinality of a minimal congruent dominating set of G is called the congruent domination number of G which is denoted by ?cd(G). Some characterizations are established and congruent domination number for various graphs have been investigated.
Cilt
13Sayı
4Bağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/5744http://jaem.isikun.edu.tr/web/index.php/current/122-vol13no4/1145
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 ... -
Secure point set domination in graphs
Gupta, Purnima; Goyal, Alka (Işık University Press, 2024-04)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) ... -
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 ...