<?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-2582</article-id>
      <title-group>
        <article-title>Burning number of path and cycle related graphs</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Jenifer</surname>
            <given-names>M. S. Mary</given-names>
          </name>
          <aff>Department of Mathematics, Stella Maris College, (Affiliated to University of Madras), Cathedral Road, Chennai, 600086, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Shanthi</surname>
            <given-names>A. S.</given-names>
          </name>
          <aff>Department of Mathematics, Stella Maris College, (Affiliated to University of Madras), Cathedral Road, Chennai, 600086, India</aff>
        </contrib>
      </contrib-group>
      <volume>29</volume>
      <issue>3</issue>
      <fpage>1347</fpage>
      <lpage>1354</lpage>
      <pub-date date-type="pub">
        <day>02</day>
        <month>03</month>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>In network theory the circulation of data is modelled into a graph and the idea of graph burning is applied. Graph burning is the concept of finding the minimum number of moves that takes for the propagation of data in a network. Even in the cases of memes passed in social media platforms like Facebook and Instagram how quickly an information reaches its followers and the impact of it which affects the entire network can be determined by finding the burning number of the network. In this paper we have determined the burning number of a graph which has path attached with a graph which has diameter 2, flower network and sunlet graph.</p>
      </abstract>
      <kwd-group>
        <kwd>Burning</kwd>
        <kwd>Cycle</kwd>
        <kwd>Diameter</kwd>
        <kwd>Flower network</kwd>
        <kwd>Sunlet</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>
