<?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-1994</article-id>
      <title-group>
        <article-title>Square difference labeling and co-secure domination in middle graph of certain graphs</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Sarmitha</surname>
            <given-names>G.</given-names>
          </name>
          <aff>Department of Mathematics, Faculty of College of Engineering and Technology, Kattankulathur, SRM Institute of Science and Technology, Chengalpattu, Tamil Nadu, 603203, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Vidyanandini</surname>
            <given-names>S.</given-names>
          </name>
          <aff>Department of Mathematics, Faculty of College of Engineering and Technology, Kattankulathur, SRM Institute of Science and Technology, Chengalpattu, Tamil Nadu, 603203, India</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Nayak</surname>
            <given-names>Soumya Ranjan</given-names>
          </name>
          <aff>School of Computer Engineering, KIIT Deemed to be University, Bhubaneswar, Odisha, 751024, India</aff>
        </contrib>
      </contrib-group>
      <volume>27</volume>
      <issue>4</issue>
      <fpage>1403</fpage>
      <lpage>1413</lpage>
      <pub-date date-type="pub">
        <day>26</day>
        <month>06</month>
        <year>2024</year>
      </pub-date>
      <abstract>
        <p>This paper focus on the dynamic and quickly developing subject of graph Domination study. In this paper, Co-Secure Domination and Square diffrence Labeling  for Middle graph of Paths and Regular Spider Graphs has been determined. The findings can be applied on protection strategy for a various communication and interconnection networks, where the routing servers as the network’s vertices and the connection between them as its edges, protecting each node in addition to the guard nodes. This ensures that the guard nodes remain secure as well, and the network as a whole is protected.</p>
      </abstract>
      <kwd-group>
        <kwd>Square difference labeling</kwd>
        <kwd>Co-secure domination</kwd>
        <kwd>Middle graph</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>
