S. Vidyanandini’s research while affiliated with SRM Institute of Science and Technology and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (17)


Fig. 19 Prism graph Π n with ordinary labeling
Fig. 23 Python code for Algorithm 2 and Output of Python code for Algorithm 2 when m = 24 , n = 6 , and x = 9
Summary of key research papers
Effective delta-labeling exploration algorithms for graph representation and DNA sequence alignment
  • Article
  • Full-text available

January 2025

·

64 Reads

International Journal of Information Technology

·

· S Vidyanandini

·

This paper explores the concept of-labeling in graph theory, introduced in 2021. It addresses the problem of identifying graphs that can be labeled with-labeling and presents generalized results for various graph families. These include path-allied graphs, cycle-related graphs, uni-cycle graphs, and hairy cycles. Practical algorithms are provided for selected graph types, with an application to DNA sequence alignment demonstrated.

Download

Quantifying topological indices in bipartite and tripartite graphs using Lyndon words and Python algorithms

November 2024

·

30 Reads

·

1 Citation

International Journal of Information Technology

Lyndon Word Representable Graphs (LWRGs) present a novel intersection between graph structures and symbolic sequences, with significant implications for chemical graph theory. This study enhances the understanding of LWRGs by deriving specific topological indices for binary and ternary core words. By linking LWRGs to topological indices, we provide new insights into the structural relationships between words and graphs. This interdisciplinary approach highlights the utility of Lyndon words in representing graph properties and underscores the relevance of topological indices in various applications, from network analysis to molecular chemistry.


Local antimagic vertex coloring of a Myceilski of graphs

March 2024

·

34 Reads

·

2 Citations

Journal of Discrete Mathematical Sciences and Cryptography

This paper presents an investigation into the fundamental properties associated with the chromatic mean and variance within specific standard graphs, alongside the application of the Mycielski transformation to select graph structures. Furthermore, our study delves into the practical implications of local antimagic vertex coloring, emphasizing its significance in the fields of network security and anomaly detection.





δ and prime-labelling of a tree from caterpillars

January 2024

·

12 Reads

·

1 Citation

Journal of Discrete Mathematical Sciences and Cryptography

This paper explores δ-labelling and prime labelling for trees derived from caterpillar structures. In δ-labelling, vertex labels induce injective edge labels, while prime labelling ensures adjacent vertices have a greatest common divisor of one. An algorithm for efficiently labelling caterpillar trees using both methods is introduced. These labelling techniques have practical applications in network security and cryptography, providing new strategies to strengthen the security and robustness of communication networks and cryptographic systems.


Figure 1 Illustration of Star Graph Case (i): Suppose the vertex u and the vertex v are adjacent then d(u, v) = 1. The vertices u = x and v = v k+1 , 1 k n ≤ ≤ Therefore ( ) ( ) 2 f u f v + = 1 1 2 k + + = 2 2 k+ and ( , ) d u v + ( ) ( ) 2 f u f v + ≥ 2 Case (ii): Suppose the vertex u and the vertex v are non-adjacent then d(u, v) > 1 the vertices u = v k and v = v k+1
Radial radio mean labelling of Grotzsch graph and some graphs

January 2024

·

81 Reads

Journal of Discrete Mathematical Sciences and Cryptography

A graph G is undirected with V vertices and E edges. This study introduces radial radio mean labelling of graphs, a novel method of graph labelling. A radial radio mean labelling of the undirected graph G is a function g : V(G) → {1, 2, …, n} that satisfies the requirement g(u) + g(v)/2 between any two nodes u, v belongs to G and r(G) is the radius of G. The greatest integer in the range of a radial radio mean labelling g is the span, and it is represented by span (g). The minimal span over all G radial radio mean labelling is known as the radial radio mean number rrmn(G). The radial radio mean number of the Grotzsch graph and some graphs have been analyzed in this paper.


Figure 2 Triangular Graph Let and be the vertices and and are edges of the graph , as illustrated in Figure 2. Define the the unique mapping function as follows and . Define a edge function such as is bijection. The edge values are defined by and . Therefore . So is Uniform(even) Vertex odd Mean Labeling. A graph that admits Uniform(even) Vertex odd Mean Labeling is a Uniform(even) Vertex odd Mean Labeling graph. Theorem 3: An alternate triangular snake graph satisfies Uniform(even) Vertex odd Mean Labeling. Proof: Let be a graph with are the vertices and are the edges of the graph as illustrated in Figure 3
Figure 3 Alternate triangular snake Graph Define the the unique mapping function as follows and the edges function defined by as follows is a bijection function. The edge values are . Hence .
Figure 4 Caterpillar Graph Define the unique mapping function as follows
Figure 5 Graph
Figure 6 Double alternate triangular graph
© Even vertex odd mean labeling of some graphs

January 2024

·

62 Reads

Journal of Discrete Mathematical Sciences and Cryptography

This work introduces the principle of “an even point (vertex) odd ratio (mean) labeling, which is specifically applied to a graph ‘G’ consisting of ‘p’ vertices and ‘q’ edges. Even point (vertex) odd ratio (mean) labeling is exhibited by a graph G in the presence of an injectionbased function f : V of G → {0, 2, 4, ... 2q – 2, 2q} ensuring that the function derived from it (induced map) g* : E of G→{1, 3, 5, ... 2q – 1} specified by g* (uv) = g(u)+g(v)/2 is a bijection. Graphs that meet these criteria are termed an even point (vertex) odd ratio (mean) graphs. This paper explores the properties of an even point (vertex) odd ratio (mean) labeling in various graph structures.


Square difference labeling and co-secure domination in middle graph of certain graphs

January 2024

·

15 Reads

Journal of Discrete Mathematical Sciences and Cryptography

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.


Citations (7)


... • Our research is motivated by the challenge posed by many graphs that resist effective representation through Proc. SPIE [25] 2011 S. Arumugam, Jay Bagga Graceful labeling algorithms and complexity-a survey traditional labeling methods. -labeling offers a promising solution for representing such graphs, providing a new perspective on graph labeling. ...

Reference:

Effective delta-labeling exploration algorithms for graph representation and DNA sequence alignment
Quantifying topological indices in bipartite and tripartite graphs using Lyndon words and Python algorithms
  • Citing Article
  • November 2024

International Journal of Information Technology

... Parvathi and Vidyanandini have made significant advancements in this area by demonstrating the existence of graceful trees constructed from caterpillars and other classes of graph labeling [6]. Sethukkarasi A. et al. have proven the composite labeling of some graphs [7] and the local antimagic labeling of Michalski graphs [8]. In recent years, there has been significant progress in the field of artificial intelligence and network technologies. ...

Local antimagic vertex coloring of a Myceilski of graphs
  • Citing Article
  • March 2024

Journal of Discrete Mathematical Sciences and Cryptography

... Parvathi and Vidyanandini have made significant advancements in this area by demonstrating the existence of graceful trees constructed from caterpillars and other classes of graph labeling [6]. Sethukkarasi A. et al. have proven the composite labeling of some graphs [7] and the local antimagic labeling of Michalski graphs [8]. In recent years, there has been significant progress in the field of artificial intelligence and network technologies. ...

Graph Composite Labeling techniques and Practical Applications
  • Citing Conference Paper
  • February 2024

... In their work [1], Arumugam et al. provided precise values for "the local antimagic chromatic numbers of" several specific graphs, including (Path with vertices), (Cycle with vertices), , (Complete bipartite graph with m and n having the same remainder when divided by 2), , (Wheel graph with n being a multiple of 4.), and ( ) (A graph formed by adding a vertex to every edge of the Star graph ). For further insights into graph labeling techniques, consult references [18,19,20,21]. This paper not only explores graph-theoretical findings but also introduces fundamental statistical concepts such as mean and variance, providing values for these parameters across various standard graphs [10,11]. ...

Edge Irregularity Strength Exists in the Anti-theft Network
  • Citing Chapter
  • January 2022

·

S. Vidyanandini

·

E. Sreedevi

·

[...]

·

... In their work [1], Arumugam et al. provided precise values for "the local antimagic chromatic numbers of" several specific graphs, including (Path with vertices), (Cycle with vertices), , (Complete bipartite graph with m and n having the same remainder when divided by 2), , (Wheel graph with n being a multiple of 4.), and ( ) (A graph formed by adding a vertex to every edge of the Star graph ). For further insights into graph labeling techniques, consult references [18,19,20,21]. This paper not only explores graph-theoretical findings but also introduces fundamental statistical concepts such as mean and variance, providing values for these parameters across various standard graphs [10,11]. ...

CUBIC DIFFERENCE LABELING FOR GRACEFUL TREE CONSTRUCTED FROM CATERPILLAR
  • Citing Article
  • October 2020

Advances in Mathematics Scientific Journal

... In their work [1], Arumugam et al. provided precise values for "the local antimagic chromatic numbers of" several specific graphs, including (Path with vertices), (Cycle with vertices), , (Complete bipartite graph with m and n having the same remainder when divided by 2), , (Wheel graph with n being a multiple of 4.), and ( ) (A graph formed by adding a vertex to every edge of the Star graph ). For further insights into graph labeling techniques, consult references [18,19,20,21]. This paper not only explores graph-theoretical findings but also introduces fundamental statistical concepts such as mean and variance, providing values for these parameters across various standard graphs [10,11]. ...

CUBE DIFFERENCE LABELING FOR COMPLETE TRIPARTITE GRAPH
  • Citing Article
  • September 2020

Advances in Mathematics Scientific Journal

... Simply put, the decision tree algorithm is to find the characteristics in the data by analyzing the historical data with clear results. And use this as a basis to predict the newly generated data results (Sivakumar et al., 2018). The decision tree used in this study is a random decision tree, that is, when the training sample generates the decision tree, the features and thresholds selected by each node of each tree are randomly obtained. ...

An empirical study of supervised learning methods for Breast Cancer Diseases
  • Citing Article
  • August 2018

Optik