INDEPENDENT STRONG DOMINATION NUMBER OF INDU-BALA PRODUCT OF GRAPHS

Priyadharshini M., Parvathi N., CANGÜL İ. N.

Palestine Journal of Mathematics, cilt.12, sa.2, ss.80-88, 2023 (Scopus) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 12 Sayı: 2
  • Basım Tarihi: 2023
  • Dergi Adı: Palestine Journal of Mathematics
  • Derginin Tarandığı İndeksler: Scopus
  • Sayfa Sayıları: ss.80-88
  • Anahtar Kelimeler: domination, graph product, Indu-Bala product, strong domination, strong domination number
  • Bursa Uludağ Üniversitesi Adresli: Evet

Özet

A set D⊂ V be the strong dominating set of G if every vertex in V − D is strongly dominated by at least one vertex in D. The strong domination number γst(G) of G is the minimum cardinality of a strong dominating set. The independent strong domination number is(G) of a graph G is the minimum cardinality of a strong dominating set which is independent. In this paper, by means of the degree sequences (DS) of graphs and some graph theoretical methods, we determine the independent strong domination number of Indu-Bala product of simple connected graphs and null graphs.