# Lekshmi R SPSG College of Technology | psg · Department of Applied Mathematics and Computational Sciences

Lekshmi R S

Doctor of Philosophy

## About

10

Publications

500

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

42

Citations

Citations since 2017

## Publications

Publications (10)

Graph similarity plays an essential role in various fields of scientific and industry oriented applications such as bioinformatics and computational chemistry. The process of determining structural similarities between chemical structures of molecules helps to identify common behavior of these molecules. A promising approach to capture the structur...

Communication networks are ubiquitous, increasingly complex, and dynamic. Predicting and visualizing common patterns in such a huge graph data of communication network is an essential task to understand active patterns evolved in the network. In this work, the problem is to find an active pattern in a communication network which is modeled as detec...

Maximum common induced subgraph (MCIS) of a communication network graph database determine the common substructures which are always active and retain the links between any pair of nodes exactly as in all graphs of the database. Many benchmark graph algorithms to predict MCIS of a graph database deal only with two graphs at a time and seek isomorph...

The rapid development of network technologies and computing machines has broadened
the scope of research and development in computer science and allied areas. To provide a
broad interdisciplinary research forum, the International Conference on Computational
Intelligence, Cyber Security, and Computational Models (ICC3-2013) has been organized
by...

The need for dominating cycles is continuously growing, with the intensification of applied sciences, due to their immense applications especially in networks of all kind. In this paper, new concepts like perfect matching sequences, perfect matching dominating cycles and perfect matching minor are introduced for undirected, loopless, connected even...

Graph decompositions are vital in the study of combinatorial design theory. Given two graphs G and H, an H- decomposition of G is a partition of the edge set of G into disjoint isomorphic copies of H. An n-sun is a cycle Cn with an edge terminating in a vertex of degree one attached to each vertex. In this paper we have proved that the complete gra...

Graph decompositions are vital in the study of combinatorial design theory. A decomposition of a graph G is a partition of its edge set. An n-sun graph is a cycle Cn with an edge terminating in a vertex of degree one attached to each vertex. In this paper, we define n-sun decomposition of some even order graphs with a perfect matching. We have prov...

Graphs having a particular structure always attracts and find application in sciences. If G is a simple graph with a perfect matching M, then a perfect matching minor of G with respect to M is the graph obtained by contracting all the edges of M. A perfect matching dominating cycle of G is a dominating cycle to which the edges of M are either in th...

In this paper, we have found the number of distinct perfect matching dominating cycles for complete, complete bipartite, Petersen's and Wheel graphs. For a particular choice of perfect matching, the number is found for the hypercube graph. Since the necessary and sufficient condition for the existence of perfect matching dominating cycles is that t...

## Projects

Project (1)

Finding variations of dominating cycles in graphs.
Counting triangulations in nonconvex polygons