Irreversible k-Threshold Conversion Number of the Strong Product of Two Paths when k=2,3

Authors

  • Ramy Shaheen Tishreen University
  • Suhail Mahfud Tishreen University
  • Ali Kassem Tishreen University

Abstract

                The irreversible k-threshold conversion process on a simple and finite graph  is an iterative process which starts by choosing a set , and for each step    is obtained from  by adjoining all vertices that have at least k neighbors in .  is called the seed set of the k-threshold conversion process and is called an irreversible k-threshold conversion set (IkCS) of  if  for some  . The minimum cardinality of all the IkCSs of  is referred to as the irreversible k-threshold conversion number of and is denoted by  In this paper, we determine the irreversible k-threshold conversion number of the strong product of two paths  and  for  and arbitrary  when

Published

2022-08-03

How to Cite

1.
رامي شاهين, سهيل محفوض, علي قاسم. Irreversible k-Threshold Conversion Number of the Strong Product of Two Paths when k=2,3. TUJ-BA [Internet]. 2022Aug.3 [cited 2024Nov.29];44(3):67-82. Available from: https://journal.tishreen.edu.sy/index.php/bassnc/article/view/13249