<?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-2488</article-id>
      <title-group>
        <article-title>Utilizing line graph construction in combinatorial analysis for network optimization</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Panchbhai</surname>
            <given-names>Ashutosh</given-names>
          </name>
          <aff>Symbiosis Law School Pune, Symbiosis Centre for Advanced Legal Studies and Research, Symbiosis International (Deemed University), Pune, Maharashtra, 411014, India</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Singh</surname>
            <given-names>Tanya</given-names>
          </name>
          <aff>Department of School of Engineering &amp; Technology, Noida International University, Greater Noida, Uttar Pradesh, 203201, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Kolekar</surname>
            <given-names>Vikas</given-names>
          </name>
          <aff>Department of Computer Engineering, Vishwakarma Institute of Technology, Pune, Maharashtra, 411037, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Bamane</surname>
            <given-names>Kalyan Devappa</given-names>
          </name>
          <aff>Department of Computer Engineering, Akurdi 411044, D. Y. Patil College of Engineering, Pune, Maharashtra, 411044, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Bhagyam</surname>
            <given-names>N. Jaya</given-names>
          </name>
          <aff>Department of Information Technology, KKR and KSR institute of Technology and Sciences, Guntur, Andhra Pradesh, 522017, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Lakhanpal</surname>
            <given-names>Sorabh</given-names>
          </name>
          <aff>School of Pharmaceutical Sciences, Lovely Professional University, Phagwara, Punjab, 144411, India</aff>
        </contrib>
      </contrib-group>
      <volume>29</volume>
      <issue>1</issue>
      <fpage>307</fpage>
      <lpage>315</lpage>
      <pub-date date-type="pub">
        <day>31</day>
        <month>12</month>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>This study examines how combinatorial analysis may address network optimization challenges via line graph creation. Line graphs, which can transform graphs, underpin graph theory. Points in a line graph indicate the first graph’s edges. Using this modification, we examine how network configurations might be improved for efficiency, cost reduction, and resource utilization. We tackle power, information, and transportation network challenges via line graph creation. The study uses theory and real-world examples to demonstrate how line graphs may simplify network optimization. It also discusses line graphs’ computational advantages for huge networks and their potential usage in IoT and smart communities. Line graphs may improve network systems in many combinatorial circumstances, as shown by the findings.</p>
      </abstract>
      <kwd-group>
        <kwd>Line graph construction</kwd>
        <kwd>Combinatorial analysis</kwd>
        <kwd>Network optimization</kwd>
        <kwd>Graph theory</kwd>
        <kwd>Resource allocation</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>
