# Yegnanarayanan VenkataramanKalasalingam Academy of Research and Education · Mathematics

Yegnanarayanan Venkataraman

B.Sc (Mathematics), M.Sc (Mathematics),M.Phil(Mathematics),Ph.D(Mathematics),M.Tech(Information Technology)

## About

167

Publications

27,994

Reads

**How we measure 'reads'**

A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more

372

Citations

Citations since 2016

Introduction

Additional affiliations

Education

June 2002 - April 2004

January 1993 - October 1995

June 1988 - April 1989

**School of Mathematics, Madurai Kamaraj University, Madurai**

Field of study

- Mathematics

## Publications

Publications (167)

Purpose
The purpose of this study is to present a large-scale real-world comparative study using pre-COVID lockdown data versus post-COVID lockdown data on predicting shipment times of therapeutic supplies in e-pharmacy supply chains and show that our proposed methodology is robust to lockdown effects.
Design/methodology/approach
The researchers u...

Cancer is a major research area in the medical field. Precise assessment of non-similar cancer types holds great significance in according to better treatment and reducing the risk of destructiveness in patients’ health. Cancer comprises a ambient that differs in response to therapy, signaling mechanisms, cytology and physiology. Netting theory and...

Purpose
This paper aims to address the pressing problem of prediction concerning shipment times of therapeutics, diagnostics and vaccines during the ongoing COVID-19 pandemic using a novel artificial intelligence (AI) and machine learning (ML) approach.
Design/methodology/approach
The present study used organic real-world therapeutic supplies data...

We have computed here the refereed as total domination number of the six platonic graphs. Incidentally we found that the octahedron graph is a counter example to the following result: If G is a connected graph of order at least two, then γt (G) ≥ ecc (C(G)) + 1.

Graph theory is one of the most powerful tools from the field of mathematics to help model practical problems in real time, and provides surprising answers with its wonderful methods. In this chapter, the authors describe very precisely its role in understanding the spread of the COVID-19 virus, and the efforts taken throughout the world to identif...

Forensic network analyzes intrusion evidence obtained to find out suspicious members and initiate step by step actions in an attack scenario. The evidence graph model serve as collected evidence. Depending on it one can form a framework that is based on hierarchical reasoning. Fuzzy inference comes in handy to comprehend host’s functional states fr...

The problem concerning vertex coloring of distance graphs are keenly pursued due to the motivation by the famous Hadwiger-Nelson plane coloring problem(HNP) concerning unit distance graphs. HNP asks for the minimum number of colors required for coloring the points of the two dimensional plane that are separated by a unit distance. In this paper we...

This paper offers a bird’s eye perception of how bipartite graph modeling could help to comprehend the progression of Alzheimer Disease (AD). We will also discuss the role of the various software tools available in the literature to identify the bipartite structure in AD affected patient brain networks and a general procedure to generate a graph fr...

Data collection process has witnessed explosive growth that could even outsmart the measurable gains in the field of power of computation as speculated by Moore’s Law. However, scientists spread over various domain are smearing victory through
network models to denote their data. Graph- algorithms come in handy to investigate the topological struct...

The primary aim of this paper is to publicize various problems regarding chromatic coloring of finite, simple and undirected graphs. A simple motivation for this work is that the coloring of graphs gives models for a variety of real world problems such as scheduling. We prove some interesting results related to the computation of chromatic number o...

Notice that the synapsis of brain is a form of communication. As communication demands connectivity, it is not a surprise that "graph theory" is a fastest growing area of research in the life sciences. It attempts to explain the connections and communication between networks of neurons. Alzheimer’s disease (AD) progression in brain is due to a depo...

Theory of Graphs could offer a plenty to enrich the analysis and modeling to generate datasets out of the systems and processes regarding the spread of a disease that affects humans, animals, plants, crops etc., In this paper first we show graphs can serve as a model for cattle movements from one farm to another. Second, we give a crisp explanation...

In this paper we have provided a brief expository note on graphs that are fuzzy in nature and how the fuzzy concept when mixed with graphs tend to provide better solutions for pertinent application areas as diverse as traffic management, telecommunication and brain networks. The concept of graph coloring and the utility value of neutrosophic and in...

Prime numbers and their variations are extremely useful in applied research areas such as cryptography, feedback and control in engineering. In this paper we discuss about prime numbers, perfect numbers, even perfect and odd perfect numbers, amicable numbers, semiprimes, mersenne prime numbers, triangular numbers, distribution of primes, relation b...

A vertex coloring of a graph G is a mapping that allots colors to the vertices of G. Such a coloring is said to be a proper vertex coloring if two vertices joined by an edge receive different colors. The chromatic number χ ( G ) is the least number of colors used in a proper vertex coloring. In this paper, we compute the χ of certain distance graph...

Let p ≥ 3 be a positive integer and let k ∈ (1,2, . . . p-1) ⌊p/2⌋. The generalized Petersen graph GP((p, k) has its vertex and edge set as V (GP(p, k)) = (ui: i ∈ Zp) ∪ (u'i: i ∈ Zp) and E(GP(p,k)) = (uiui+1: i ∈ Zp) ∪ (u0ⁱui+kⁱ ∈ Zp) ∪ (uiui¹: i ∈ Zp). In this paper we probe its spectrum and determine the Estrada index, Laplacian Estrada index, s...

Let D be a set of positive integers. The distance graph generated by D has all integers Z as the vertex set; two vertices are adjacent whenever their absolute difference falls in D. We determine: (i) The upper and lower bounds for the chromatic number of the distance graphs with distance set D as a set of primitive Pythagorean numbers less than 10,...

In parallel computing and computer networks, several different topologies for interconnecting processing vertices exist. It is quite an enormous task to compare such networks with reference to attributes such as diameter, average distance, traffic balance, fault tolerance, etc. In order to overcome the inherent drawbacks in ring topology, it is sug...

We determine here the domination and total domination number of Rolf Nevanlinna Prize winners (1982-2014) collaboration graph-RNPCG besides giving a brief introduction about the prize, the method of construction of the collaboration graph, a software tool used for drawing the collaboration graph, etc.

In this paper, we compute various Domination numbers like Outer Connected Domination (OCD), Doubly Connected Domination (DCD), Fair Domination (FD), Independence Domination (ID), 2-Packing (2-P) for Rolf Nevanlinna Prize Winners's Collaboration Graph (RNPCG).

In this paper, we determine for a simple graph G on n vertices and m edges a variety of domination parameters such as connected domination number, outer connected domination number, doubly connected domination number, global domination number, total global connected domination number, 2-connected domination number, strong domination number, fair do...

The concept of vertex coloring pose a number of challenging open
problems in graph theory. Among several interesting parameters, the
coloring parameter, namely the pseudoachromatic number of a graph
stands a class apart. Although not studied very widely like other parameters
in the graph coloring literature, it has started gaining prominence
in rec...

Given a connected (p, q) graph with a number of central vertices, form a new graph G∗ as follows: V(G∗) = V(G); Delete all the edges of G. Introduce edge between every central vertex to each and every non central vertex of G; allow every pair of central vertices to be adjacent. In this paper we probed G∗ and deducted a number of results.

Given a subset D of positive integers, an integer
distance graph is a graph G(Z, D) with the set Z of integers as vertex
set and with an edge joining two vertices u and v if and only if
|u−v| ∈ D. In this paper we consider the problem of determining the
chromatic number of certain integer distance graphs G(Z, D)whose
distance set D is either 1) a s...

In this paper, we compute for paths and cycles certain graph domination invariants like locating domination number, differentiating domination number, global alliance number, etc. We also do some comparison analysis of certain parameters defined by combining the domination measures and the second smallest eigen value of the Laplacian matrix of all...

Graph labelings is an active area of research in graph theory. There are many types of graph labelings which have been considered in recent years. A graph G(p,q) is said to be (1,1) edge-magic with the common edge count k 0 if there exists a bijection f:V(G)∪E(G)→{1,⋯,p+q} such that f(u)+f(v)+f(e)=k 0 for all e=(u,v)∈E(G). A graph G(p,q) is said to...

In this paper first, we give a brief introduction about integer distance graphs. An integer distance graph is a graph G(Z,D) with the set of integers as vertex set and an edge joining two vertices u and v if and only if |u - v| ∈ D where D is a subset of the positive integers. If D is a subset of P then we call G(Z,D) a prime distance graph. Second...

We are well aware of the ever increasing importance of graphical and matrix representations in applications to several day-to-day real life problems. The interconnectedness of the notion of graph, matrix, probability, limits, and system of equations are visible and approachable in the use of Markov Chains. We discuss here an interesting activity th...

Given a subset D of positive integers, an integer distance graph is a graph G(ℤ,D) with the set ℤ of integers as vertex set and with an edge joining two vertices u and v if and only if |u−v| ∈ D. In this paper we consider the problem of determining the chromatic number of certain integer distance graphs G(ℤ,D)whose distance set D is either 1) a set...

The risks to users of wireless technology have increased as the service has become more popular. Due to the dynamically changing topology, open environment and lack of centralized security infrastructure, a mobile ad hoc network (MANET) is vulnerable to the presence of malicious nodes and to ad hoc routing attacks. There are a wide variety of routi...

The problem of determining the collaboration graph of co-authors of Paul Erdos is a challenging task. Here we take up this problem for the case of Rolf Nevalinna Prize Winners. Even though the number of these prizewinners as on date is 7, the collaboration graphs has 20 vertices and 41 edges and possess several interesting properties. In this paper...

We have given in this paper a fairly decent introduction to the importance of the study of centrality measures of distance graphs. We have discussed at length several concepts with a number of interesting examples and highlighted interesting results. Then the scope of practical applicability of the concepts is also indicated.

A main goal of this paper is to highlight how graph theory and its carefully evolved network models help in the study of various complex networks in real-life situations, for instances, the human brain. We give an overview of the growth of the complex network of the brain and various types of brain connectivity. We also summarize a few open problem...

Numerous challenging problems in graph theory have attracted the attention and imagination of researchers from physics, computer science, engineering, biology, social sciences and mathematics. If we put all these different branches one into basket, what evolves is a new science called “Network Science”. It calls for a solid scientific foundation an...

Primes constitute the holy grail of analytic number theory, and many of the famous theorems and problems in number theory are statements about primes. Analytic number theory provides some powerful tools to study prime numbers, and most of our current still rather limited knowledge of primes has been obtained using these tools. Our main objective in...

The rapid growth of automation in manufacturing industry results demands better computer vision. Hence computer vision now plays an important role in product inspection, assembly, and design in reverse engineering. In this paper we discuss briefly the importance of certain graph theory techniques for developing a method for automatic sensor placeme...

The study of social networks by anthropologists has been based on the basic notions of graph theory, as has the identification and analysis of social cliques. There is little consensus among mathematicians about terminology, and social scientists have drawn fortuitously on various mathematical vocabularies as well as inventing their own technical t...

The study of interference graphs assumes significance in the context of the study of Frequency assignment problem. By an interference graph we mean the graph whose vertices represent a transmitter and the edges denote the interference constraint between two adjacent transmitters. In this paper we probe the relationship between 2-coloring and radio...

By a (1, 1) edge-magic labeling of a (p, q) graph G we mean a bijection f:V(G)∪E(G)→{1,…,p+q} such that f(u)+f(v)+f(uv)=k is a constant for any edge uv of G. We call a graph G (1, 1) edge-magic if it has a (1, 1) edge-magic labeling f and in which case, the integer k is called the common edge count of f. We further call f a nice (1, 1) edge-magic l...

Product graphs play a vital role not only in pure mathematics but also in applied mathematics. In this paper we discuss about various products and their applications at least one each to: a) Computer Science and b) Graph Coloring. A few potential areas wide open for further research are also indicated for researchers.

By a pseudocomplete coloring of a graph G we mean a coloring of the vertices of G (not necessarily proper) such that for any two distinct colors, there exist at least one edge in G with these colors on its end vertices. The maximum number of colors used in a pseudocomplete coloring of G is called the pseudoachromatic number of G. In this paper we p...

Number-theoretic properties are used to classify simple graphs that are finite with no isolated vertices. A graph G of size q is defined to be a product (0,1) vertex magic if there is a labeling from E(G) onto {1,⋯,q} such that at each vertex v, the product of the labels on the edges incident with v is the same. Similarly a graph G with p vertices...

## Questions

Question (1)

I want to characterize the class 3 and class 4 graphs. By class 3 I mean ch no.(G(Z,D))= 3 where D is a subset of the set of primes P. By class 4 I mean ch no.(G(Z,D))= 4 where D is a subset of the set of primes P and the cardinality of D is greater than or equal to 4. Any body working in this type of problems can contact me.

Dr V.yegnanarayanan

senior Professor, Mathematics

Velammal Engineering College

Chennai-600066, TN, India.

## Projects

Projects (2)

To characterize the Class 3 and Class 4 Prime distance graphs

To Compute the chromatic number of Prime distance graphs and to find stronger results on prime distance labeling and to find the relationship between these two concepts.