International Journal of Neutrosophic Science IJNS 2690-6805 2692-6148 10.54216/IJNS https://www.americaspg.com/journals/show/3172 2020 2020 Faculty of Computer Studies, Arab Open University, Saudi Arabia Ahmad Ahmad Department of Mathematics, Faculty of Science and Information Technology, Jadara University, P.O. Box 733, Irbid 21110, Jordan Raed Hatamleh Faculty of Computer Studies, Arab Open University, Saudi Arabia Khaled Matarneh Department of Mathematics, Faculty of Science and Technology, Irbid National University, P.O. Box: 2600 Irbid, Jordan; Jadara Research Center, Jadara University, Irbid 21110, Jordan Abdallah Al Al-Husban An irreversible k-threshold conversion process on a graph G=(V,E) is an iterative process that studies the spread of a one way change (from state 0 to 1) on V(G). The process begins by choosing a set S_0⊆V. For each step t(t=1,2,…,), S_t is obtained from S_(t-1) by adjoining all vertices that have at least k neighbors in S_(t-1). We call S_0 the seed set of the k-threshold conversion process and if S_t=V(G) for some t≥0, then S_0 is called an irreversible k-threshold conversion set (IkCS) of G. The k-threshold conversion number of G (denoted by (c_k (G)) is the minimum cardinality of all the IkCSs of G. In this paper, we study IkCSs of toroidal grids and the tensor product of two paths. We determine c_2 (C_3×C_n )  and we present upper and lower bounds for c_2 (C_m×C_n) for m,n≥3. We also determine c_2 (P_2×P_n ),c_2 (P_3×P_n ) and present an upper bound for c_2 (P_m×P_n) when m,n>3. Then we determine c_3 (P_m×P_n) for m=2,3,4 and arbitrary n. Finally, we determine c_4 (P_m×P_n) for arbitrary m,n. . Also, we study the same concepts over some neutrosophic graphs with suggestions for future neutrosophic and fuzzy generalizations. 2025 2025 183 196 10.54216/IJNS.250216 https://www.americaspg.com/articleinfo/21/show/3172