Work

A Family of Join Spider Graphs on Sum Divisor Cordial Labeling with Application

Year: 2024

Type: article

Abstract: A graph G with p vertices and q edges is said to be a Sum Divisor Cordial labelling. If ????: ???? → 1,2, … ???? such that for each edge ???????????????? assign the label 1, if 2|(???? ???? + ????(????)| and 0 otherwise, satisfying the condition |e????(1)- e???? 0 | ≤ 1, where e????(1) is the number of edges labelled with 1 and e????(0) is the number of edges labelled with 0. A graph with a sum divisor cordial labeling graph. In this paper we study and we prove that for a class of Join Spider graphs with atmost one additional leg namely JSP(1m,2n), JSP(1m,2n,32), JSP(1m,2n,42), JSP(1m,2n,52). In this paper we identify an application using Affline Cipher for Cyber Security through encryption and decryption.

Source: Advances in Nonlinear Variational Inequalities

DOI: 10.52783/anvi.v27.548

Author: T, Christy

Institutions: Government of Tamil Nadu, University of Madras, Patrician College of Arts and Science

Language: English

Topic: Graph Labeling and Dimension Problems

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W4404421909

FWCI:

Cites:

Cited by:

Related to: 10