<?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-2235</article-id>
      <title-group>
        <article-title>Invariant intersection graph of a graph</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Madhumitha</surname>
            <given-names>S.</given-names>
          </name>
          <aff>Department of Mathematics, Christ University, Bangalore, Karnataka, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Naduvath</surname>
            <given-names>Sudev</given-names>
          </name>
          <aff>Department of Mathematics, Christ University, Bangalore, Karnataka, India</aff>
        </contrib>
      </contrib-group>
      <volume>28</volume>
      <issue>6</issue>
      <fpage>2323</fpage>
      <lpage>2335</lpage>
      <pub-date date-type="pub">
        <day>28</day>
        <month>07</month>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>Studies in algebraic graph theory showcase the interplay between group theory and graph theory by defining graphs on groups, investigating their properties, and also by analysing the automorphism groups that emerge from the graphs. In this article, we introduce the idea of constructing an algebraic derived graph; that is, constructing a graph based on the algebraic properties of a graph, by introducing the invariant intersection graph of a graph, constructed based on the automorphism group of a graph. Here, we introduce the graph construction and initiate an investigation on the structure of the invariant intersection graph with respect to the graph and its automorphism group.</p>
      </abstract>
      <kwd-group>
        <kwd>Intersection graphs</kwd>
        <kwd>Automorphism group</kwd>
        <kwd>Invariant set</kwd>
        <kwd>Invariant intersection 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>
