Sankar Chakaravarthy

Mr. Sankar Chakaravarthy


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2020
Verified
Journal Article
Closed access
PDF file
AAAdmin Admin
Admin Admin
SRSujatha Ramalingam
Sujatha Ramalingam
DND. Nagarajan
D. Nagarajan
SCSankar Chakaravarthy
Sankar Chakaravarthy
COVID-19 is pandemic affecting most of the country globally. It is an infectious disease that is affecting most of the people and it is very difficult to diagnose and treat the diseased patient. Generally asymptotic patients recover without any treatment. Patients with other illness such as Hypertension, Heart and Lung problems, Diabetic patients require intense care and treatment. In such cases, a team of doctors work together. The combination of all the experts’ opinions is needed for efficient treatment. Often, the opinion of doctors depends on their experience and involves some differences. Further, the expert’s opinion is in linguistic terms. Plithogenic sets provide a mathematical tool for aggregation of the experts’ opinion expressed in linguistic terms. Thus, this work aims to employ plithogenic neutrosophic number to rank the diseased patients affected with COVID-19. Hence, we propose an Order Preference Technique by Similarity to Ideal Solutions (TOPSIS) using Plithogenic sets.

3 June 2025 in Ain Shams Engineering Journal
Verified
Journal Article
Open access
SCSankar Chakaravarthy
Sankar Chakaravarthy
CKChandran Kalaivani
Chandran Kalaivani
MSMariappan Saravanan
Mariappan Saravanan
RSRamalingam Sujatha
Ramalingam Sujatha

15 May 2025 in Symmetry
Verified
Journal Article
Open access
PDF file
SCSankar Chakaravarthy
Sankar Chakaravarthy
KCKalaivani Chandran
Kalaivani Chandran
PCP Chellamani
P Chellamani
VGVenkat Narayanan Gangatharan
Venkat Narayanan Gangatharan
The concept of domination is introduced within the context of signed fuzzy graphs (signed-FGs), along with examples, as a novel metric to evaluate graph stability under varying conditions. This metric particularly focuses on dominant sets and integrity measures, providing a well-rounded approach to assessing the structural stability of signed- FGs. The necessity of fulfilling the domination integrity condition in evaluating the performance of signed-FGs is highlighted through a discussion on its formulation and an analysis of its upper and lower bounds. An algorithm for identifying strong arcs and classifying them is presented, along with an algorithm for identifying signed fuzzy trees. Furthermore, the role of symmetry in signed-FGs is explored, revealing that symmetrical structures often correspond to higher domination integrity, thus contributing to the improved stability and predictability of the graphs. The paper also establishes important connections with classical graph varieties, such as complete graphs and their variations, demonstrating that changes in domination integrity increase with certain parameters. Additionally, real-life scenarios where these concepts are applicable serve to complement the theoretical results. The case study findings illustrate the significance of domination integrity in practical contexts by emphasizing various instances where it can be determined and utilized. Such instances include identifying independent dominant sets in path and cycle diagrams, as well as estimating the lower bounds of domination integrity in these structures. The estimation of domination integrity using block graph methods is underscored as crucial for enhancing the efficiency of signed-FG applications.

5 November 2025 in European Journal of Pure and Applied Mathematics
Verified
Journal Article
Open access
PDF file
SCSankar Chakaravarthy
Sankar Chakaravarthy
MSMariappan Saravanan
Mariappan Saravanan
SRSujatha Ramalingam
Sujatha Ramalingam
VGVenkat Narayanan Gangatharan
Venkat Narayanan Gangatharan
Signed Fuzzy Graphs (SFGs), a mathematical structure having nodes associated with membership values and edges consisting of positive and negative signs, give a multi-faceted mathematical model to deal with uncertainty and polarity in graph-based networks. Exploring the theories of SFG and its applications helps to understand the complex networks and their characteristics. This study intends to examine the key theorems pertaining to vertex and edge degrees and their membership values by highlighting their real-time applications in Wireless Sensor Networks (WSNs) and Environmental Monitoring Systems (EMSs), where sensor nodes must maintain reliable communication. The main focus of this paper shifts from the exploration of theorems about vertex and edge degree and their membership values to the introduction of new domination metrics tailored for SFGs, the domination sets and minimum domination sets and their relevance to efficient placement and the operation of WSNs in EMSs. SFGs facilitate effective data collection by ensuring network coverage. This study makes a significant contribution to the field of Fuzzy Mathematics with a comprehensive understanding of complex networks and their characteristics.

29 March 2026 in Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics
Verified
Journal Article
Open access
SCSankar Chakaravarthy
Sankar Chakaravarthy
SMSaravanan Mariappan
Saravanan Mariappan
SRSujatha Ramalingam
Sujatha Ramalingam
VGVenkat Narayanan Gangatharan
Venkat Narayanan Gangatharan
The integrity parameter relates a set of vertices and other disconnected components. For improved connectivity, a vulnerability parameter should address the relation between all vertices. Spanning integrity encourages all the vertices to be connected by means of spanning. In this paper, the vulnerability parameter spanning integrity is introduced, for the signed fuzzy graph (SFG). The parameter is defined and explained with some examples. The spanning integrity is determined for standard SFGs, such as star SFG, complete SFG, bipartite SFG and complete bipartite SFG. Operations on SFGs are discussed. Spanning integrity is calculated for union, join, and Cartesian products of SFG. An algorithm is presented to compute the spanning integrity of SFG. This algorithm is validated by practical application in air networks. It helps to find the best route and to overcome the complicated connection between destinations while implementing a new air project, in a simple manner.