<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-discrete-mathematical-sciences-and-cryptography</journal-id>
      <journal-title-group>
        <journal-title>Journal of Discrete Mathematical Sciences and Cryptography</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-0065</issn>
      <issn publication-format="print">0972-0529</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JDMSC-2776</article-id>
      <title-group>
        <article-title>Digraphs based on BL-algebras</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Daneshpayeh</surname>
            <given-names>Roohallah</given-names>
          </name>
          <aff>Department of Mathematics, Payame Noor University, Lashkarak Road, Tehran, P. O. Box 19395-4697, Iran</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Jahanpanah</surname>
            <given-names>Sirus</given-names>
          </name>
          <aff>Department of Mathematics, Payame Noor University, Lashkarak Road, Tehran, P. O. Box 19395-4697, Iran</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Saeid</surname>
            <given-names>Arsham Borumand</given-names>
          </name>
          <aff>Department of Pure Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran</aff>
        </contrib>
      </contrib-group>
      <volume>29</volume>
      <issue>7</issue>
      <fpage>2939</fpage>
      <lpage>2962</lpage>
      <pub-date date-type="pub">
        <day>31</day>
        <month>07</month>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>This paper considers the notion of BL-algebras and converts any Galois finite field to a BL-algebra. It extends the class of BL-algebras based on finite fields and makes a connection between finite fields and BL-algebras. This study introduces the concept of a down digraph based on the notion of a down set (as a vertex) of BL-algebras, which states that any two vertices are adjacent if the related down sets are not joined. Characterization of the down digraphs is fundamental in this research, so we compute the number of edges in some down digraphs via combinators, to prove that down digraphs are connected under what conditions are connected and are Tournament. In the final, try to extract the BL-algebras from graphs, so show that any connected graph constructs a BL-algebra.</p>
      </abstract>
      <kwd-group>
        <kwd>BL-algebra</kwd>
        <kwd>Down set</kwd>
        <kwd>Down digraph</kwd>
        <kwd>Critical edges</kwd>
        <kwd>(U.C)-lattice</kwd>
        <kwd>Tournament</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>
