<?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-40-3833-1792469568</doi_batch_id>
  <timestamp>20261020041248</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>Pure Mathematics for Theoretical Computer Science</full_title>
    <abbrev_title>PMTCS</abbrev_title>
    <issn media_type="electronic">2995-3162</issn>
   </journal_metadata>
   <journal_issue>
    <publication_date media_type="online">
     <year>2025</year>
    </publication_date>
    <journal_volume>
     <volume>5</volume>
    </journal_volume>
    <issue>1</issue>
   </journal_issue>
   <journal_article publication_type="full_text">
    <titles>
     <title>HyperWeighted Graph, SuperHyperWeighted Graph, and MultiWeighted Graph</title>
    </titles>
    <contributors>
     <person_name sequence="first" contributor_role="author">
      <given_name>Takaaki</given_name>
      <surname>Fujita</surname>
      <affiliations>
       <institution>
        <institution_name>Independent Researcher, Shinjuku, Shinjuku-ku, Tokyo, Japan</institution_name>
       </institution>
      </affiliations>
     </person_name>
    </contributors>
    <jats:abstract>
     <jats:p>A weighted graph is a graph in which each edge is assigned a numerical value (weight), typically representing cost, distance, or intensity. In this paper, we revisit and further explore three generalizations of weighted graphs: the Hyperweighted Graph, the Superhyperweighted Graph, and the MultiWeighted Graph. These advanced structures were initially introduced in.10 Our objective is to enhance understanding and broaden awareness of their theoretical foundations and potential applications through renewed analysis and formal refinement</jats:p>
    </jats:abstract>
    <publication_date media_type="online">
     <year>2025</year>
    </publication_date>
    <pages>
     <first_page>14</first_page>
     <last_page>22</last_page>
    </pages>
    <publisher_item>
     <item_number item_number_type="article-number">3833</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/PMTCS.050103</doi>
     <resource>https://www.americaspg.com/journal/40/article/3833</resource>
     <collection property="text-mining">
      <item>
       <resource mime_type="application/pdf">https://www.americaspg.com/storage/articles/manuscripts/01M11Z7JHVPPD3GB3FVRZ7K4A6.pdf</resource>
      </item>
     </collection>
    </doi_data>
   </journal_article>
  </journal>
 </body>
</doi_batch>
