<?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-33-3181-1792228713</doi_batch_id>
  <timestamp>20261017091833</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>Galoitica: Journal of Mathematical Structures and Applications</full_title>
    <abbrev_title>GJMSA</abbrev_title>
    <issn media_type="electronic">2834-5568</issn>
   </journal_metadata>
   <journal_issue>
    <publication_date media_type="online">
     <year>2024</year>
    </publication_date>
    <journal_volume>
     <volume>11</volume>
    </journal_volume>
    <issue>1</issue>
   </journal_issue>
   <journal_article publication_type="full_text">
    <titles>
     <title>On the Perfect Italian Domination Numbers of Some Graph Classes</title>
    </titles>
    <contributors>
     <person_name sequence="first" contributor_role="author">
      <given_name>Khadija Ben</given_name>
      <surname>Othman</surname>
      <affiliations>
       <institution>
        <institution_name>Umm Al-Qura University, Mekka, Saudi Arabia</institution_name>
       </institution>
      </affiliations>
     </person_name>
    </contributors>
    <jats:abstract>
     <jats:p>A function f:V(G)→{0,1,2} is called a Perfect Italian dominating function (PIDF) of a graph G=(V,E) if ∑_(v∈N(u)) f(v)=2 for every vertex u∈V(G) with f(u)=0. The weight of an PIDF is w(f)=∑_(v∈V) f(v) . The minimum weight of all Perfect Italian dominating functions that can be conducted on a graph G is called the perfect Italian domination number of G and is denoted by γ_I^p (G). In this paper, we study the problem on different graph classes. We determine the perfect Italian domination numbers of the circulant graphs C_n {1,2} for n≥5 and give upper bounds for γ_I^p (C_n {1,3}) when n≥7. We also find this parameter for generalized Petersen graph P(n,2) when n≥5. We determine γ_I^p (G) of strong grids P_2⊠P_n and P_3⊠P_n for arbitrary n≥2, then we introduce an upper bound for γ_I^p (P_m⊠P_n ) when m,n≥2 are arbitraries. Finally, we determine the perfect Italian domination number of Jahangir graph J_(s,m) for arbitrary s≥2 and m≥3.</jats:p>
    </jats:abstract>
    <publication_date media_type="online">
     <year>2024</year>
    </publication_date>
    <pages>
     <first_page>35</first_page>
     <last_page>46</last_page>
    </pages>
    <publisher_item>
     <item_number item_number_type="article-number">3181</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/GJMSA.0110104</doi>
     <resource>https://americaspg.com/journal/33/article/3181</resource>
     <collection property="text-mining">
      <item>
       <resource mime_type="application/pdf">https://americaspg.com/storage/01724541356.pdf</resource>
      </item>
     </collection>
    </doi_data>
   </journal_article>
  </journal>
 </body>
</doi_batch>
