<?xml version="1.0" encoding="UTF-8"?>
<doi_batch version="5.3.1" xmlns="http://www.crossref.org/schema/5.3.1" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:jats="http://www.ncbi.nlm.nih.gov/JATS1" xmlns:ai="http://www.crossref.org/AccessIndicators.xsd" xsi:schemaLocation="http://www.crossref.org/schema/5.3.1 http://www.crossref.org/schema/deposit/crossref5.3.1.xsd">
 <head>
  <doi_batch_id>aspg-21-3172-1791472126</doi_batch_id>
  <timestamp>20261008150846</timestamp>
  <depositor>
   <depositor_name>American Scientific Publishing Group</depositor_name>
   <email_address>admin@americaspg.com</email_address>
  </depositor>
  <registrant>American Scientific Publishing Group</registrant>
 </head>
 <body>
  <journal>
   <journal_metadata language="en">
    <full_title>International Journal of Neutrosophic Science</full_title>
    <abbrev_title>IJNS</abbrev_title>
    <issn media_type="print">2692-6148</issn>
    <issn media_type="electronic">2690-6805</issn>
   </journal_metadata>
   <journal_issue>
    <publication_date media_type="online">
     <year>2025</year>
    </publication_date>
    <journal_volume>
     <volume>25</volume>
    </journal_volume>
    <issue>2</issue>
   </journal_issue>
   <journal_article publication_type="full_text">
    <titles>
     <title>On the Irreversible k-Threshold Conversion Number for Some Graph Products and Neutrosophic Graphs</title>
    </titles>
    <contributors>
     <person_name sequence="first" contributor_role="author">
      <given_name>Ahmad A.</given_name>
      <surname>Abubaker</surname>
      <affiliations>
       <institution>
        <institution_name>Faculty of Computer Studies, Arab Open University, Saudi Arabia</institution_name>
       </institution>
      </affiliations>
     </person_name>
     <person_name sequence="additional" contributor_role="author">
      <given_name>Raed</given_name>
      <surname>Hatamleh</surname>
      <affiliations>
       <institution>
        <institution_name>Department of Mathematics, Faculty of Science and Information Technology, Jadara University, P.O. Box 733, Irbid 21110, Jordan</institution_name>
       </institution>
      </affiliations>
     </person_name>
     <person_name sequence="additional" contributor_role="author">
      <given_name>Khaled</given_name>
      <surname>Matarneh</surname>
      <affiliations>
       <institution>
        <institution_name>Faculty of Computer Studies, Arab Open University, Saudi Arabia</institution_name>
       </institution>
      </affiliations>
     </person_name>
     <person_name sequence="additional" contributor_role="author">
      <given_name>Abdallah</given_name>
      <surname>Al-Husban</surname>
      <affiliations>
       <institution>
        <institution_name>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</institution_name>
       </institution>
      </affiliations>
     </person_name>
    </contributors>
    <jats:abstract>
     <jats:p>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&gt;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.</jats:p>
    </jats:abstract>
    <publication_date media_type="online">
     <year>2025</year>
    </publication_date>
    <pages>
     <first_page>183</first_page>
     <last_page>196</last_page>
    </pages>
    <publisher_item>
     <item_number item_number_type="article-number">3172</item_number>
    </publisher_item>
    <ai:program name="AccessIndicators">
     <ai:license_ref applies_to="vor">https://creativecommons.org/licenses/by/4.0/</ai:license_ref>
    </ai:program>
    <doi_data>
     <doi>10.54216/IJNS.250216</doi>
     <resource>https://www.americaspg.com/journal/21/article/3172</resource>
     <collection property="text-mining">
      <item>
       <resource mime_type="application/pdf">https://www.americaspg.com/storage/51724425299.pdf</resource>
      </item>
     </collection>
    </doi_data>
   </journal_article>
  </journal>
 </body>
</doi_batch>
