Manuscript Title:

AN ALGORITHMIC APPROACH TO IMPLEMENT GRACEFUL LABELED CYCLE-STAR GRAPH

Author:

S.SARANYA, M. RAJALAKSHMI, S.AMBIKA​

DOI Number:

DOI:10.17605/OSF.IO/T8A42

Published : 2021-09-10

About the author(s)

1. S.SARANYA - Faculty of Computer Science and Engineering, Coimbatore Institute of Technology, Coimbatore.
2. M. RAJALAKSHMI - Faculty of Information Technology, Coimbatore Institute of Technology, Coimbatore.
3. S.AMBIKA​ - Assistant Professor of Mathematics, Government Arts College, Coimbatore.

Full Text : PDF

Abstract

Graph theoretic solutions aids to a greater extent in solving many real-life practical problems. Graph labeling has become a popular research interest for a broad range of applications in recent era due to its disambiguated trait. Graceful labeled graph selects distinct vertex labels which in turn induces distinct edge labels. Unlike directed graph, we choose to study on simple undirected graph as it harmonizes well with social network behavior. In this paper, we present an algorithm to implement a unicycle graceful graph from star copies on cycles. Also we illustrate the algorithmic implementation using igraph graph analysis in R toolkit. We infer representing a graph model irrespective of any number of vertices and edges maintains the graceful graph novelty.


Keywords

Graceful labeling, Cycle graph, Star graph, igraph R network, tkplot visualization, Fruchterman-Reingold layout.