<?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-2101</article-id>
      <title-group>
        <article-title>Exploring secure communication through artistic graph creation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Medini</surname>
            <given-names>H. R.</given-names>
          </name>
          <aff>Department of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, Karnataka, 576104, India</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>D’Souza</surname>
            <given-names>Sabitha</given-names>
          </name>
          <aff>Department of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, Karnataka, 576104, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Nayak</surname>
            <given-names>C. Devadas</given-names>
          </name>
          <aff>Department of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, Karnataka, 576104, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Bhat</surname>
            <given-names>Pradeep G.</given-names>
          </name>
          <aff>Department of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, Karnataka, 576104, India</aff>
        </contrib>
      </contrib-group>
      <volume>28</volume>
      <issue>1</issue>
      <fpage>143</fpage>
      <lpage>159</lpage>
      <pub-date date-type="pub">
        <day>28</day>
        <month>02</month>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>Creating art through mathematics can provide a unique way to communicate complex ideas, patterns and concepts in an aesthetically pleasing manner. Translating complex data into a visual representation is a valuable way to communicate information effectively. Also, secured communication is a highly challenging task in the contemporary world. There will always be a continuous search for better algorithms to prevent data from breaching. This paper aims to transform each word into unique artistic graphs, facilitating communication through visually appealing representation. A novel algorithmic art approach is introduced to communicate securely. Graph labeling and generalized complement of a graph are used in encryption and decryption. The proposed algorithm uses vertex even mean labeling and k(i)-complement of a graph to convert plaintext into cipher graph and vice versa. This algorithm is a symmetric key algorithm as both encryption and decryption use the same cryptographic key and is applicable for all plaintexts including special characters.</p>
      </abstract>
      <kwd-group>
        <kwd>Encryption and decryption</kwd>
        <kwd>Communication</kwd>
        <kwd>Message</kwd>
        <kwd>Graph labeling</kwd>
        <kwd>Generalized complement</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>
