<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-interdisciplinary-mathematics</journal-id>
      <journal-title-group>
        <journal-title>Journal of Interdisciplinary Mathematics</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-012X</issn>
      <issn publication-format="print">0972-0502</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JIM-1527</article-id>
      <title-group>
        <article-title>Simple method to extract minimal cut sets of a direct network</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Fadhil</surname>
            <given-names>Roaa Aziz</given-names>
          </name>
          <aff>Department of Mathematics, College of Education for Pure Sciences, University of Babylon, Babil, Iraq</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Al-Khafaji</surname>
            <given-names>Zahir</given-names>
          </name>
          <aff>Department of Mathematics, College of Education for Pure Sciences, University of Babylon, Babil, Iraq</aff>
        </contrib>
      </contrib-group>
      <volume>26</volume>
      <issue>5</issue>
      <fpage>903</fpage>
      <lpage>908</lpage>
      <pub-date date-type="pub">
        <day>15</day>
        <month>07</month>
        <year>2023</year>
      </pub-date>
      <abstract>
        <p>System planning, design, and control, network reliability validation, and evaluation are critical. The enumeration of minimal cut sets (MCs) in a network is usually more complicated than the search for minimal path sets (MPs). The purpose of this research is to offer an efficient accurate approach for enumerating directed networks’ MCs. The method is concerned with determining the MCs depending on the set of minimal path nodes.</p>
      </abstract>
      <kwd-group>
        <kwd>Reliability</kwd>
        <kwd>Network</kwd>
        <kwd>Minimal cut</kwd>
        <kwd>Minimal path</kwd>
      </kwd-group>
      <custom-meta-group>
        <custom-meta>
          <meta-name>access</meta-name>
          <meta-value>open</meta-value>
        </custom-meta>
        <custom-meta>
          <meta-name>retracted</meta-name>
          <meta-value>no</meta-value>
        </custom-meta>
      </custom-meta-group>
    </article-meta>
  </front>
</article>
