<?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-2246</article-id>
      <title-group>
        <article-title>Calculation and comparison of energy and energy based on Mostar index of the double-star graph and its line graph</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Rajabinejad</surname>
            <given-names>Zohreh</given-names>
          </name>
          <aff>Department of Mathematics, Faculty of Mathematics, Statistics and Computer Science, Semnan University, Semnan, P. O. Box 35195-363, Iran</aff>
        </contrib>
      </contrib-group>
      <volume>29</volume>
      <issue>4</issue>
      <fpage>1585</fpage>
      <lpage>1594</lpage>
      <pub-date date-type="pub">
        <day>15</day>
        <month>09</month>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>The double-star line graph is a graph built from two complete graphs of order a+1 that share a common vertex, for every positive integer a ≥ 1. In this article, we investigate concepts of energy and energy based on the Mostar index of Dsa and LDsa graphs and provide a low bound for energies. We obtain general formulas for energies of Dsa, LDsa, MoDsa, and MoLDsa. This study obtains general formulas for the Mostar energy and energy of Dsa and LDsa. Using these formulas does not require calculating eigenvalues, and we show that the energy of these graphs only depends on a, the Number of pendeng edges. We compare energies and find relationships between them. Also, we determine the highest and lowest energy. We display the obtained results, numerically and graphically and compare energies graphically.</p>
      </abstract>
      <kwd-group>
        <kwd>Double-star graph</kwd>
        <kwd>Double-star line graph</kwd>
        <kwd>Characteristic polynomial</kwd>
        <kwd>Adjacency matrix</kwd>
        <kwd>Eigenvalue</kwd>
        <kwd>Spectrum</kwd>
        <kwd>Graph energy</kwd>
        <kwd>Mostar index</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>
