Entity

Time filter

Source Type

Madurai, India

Venkatakrishnan Y.B.,SASTRA University | Swaminathan V.,Ramanujan Research Center | Kannan K.,SASTRA University
Research Journal of Applied Sciences, Engineering and Technology | Year: 2013

In this study, we define X-domatic partition of a bipartite graph. X-domatic number of a unicyclic graph is less than or equal to 3 is proved. Nordhaus Gaddum type of results involving X-domatic number are obtained and the graphs for which dx(G) + dx(Ḡ) = 2P, dx(G) + dx(Ḡ) = 2P - 1, are characterized. © Maxwell Scientific Organization, 2013.


Balaji S.,SASTRA University | Swaminathan V.,Ramanujan Research Center | Kannan K.,SASTRA University
World Academy of Science, Engineering and Technology | Year: 2010

The Minimum Vertex Cover (MVC) problem is a classic graph optimization NP - complete problem. In this paper a competent algorithm, called Vertex Support Algorithm (VSA), is designed to find the smallest vertex cover of a graph. The VSA is tested on a large number of random graphs and DIMACS benchmark graphs. Comparative study of this algorithm with the other existing methods has been carried out. Extensive simulation results show that the VSA can yield better solutions than other existing algorithms found in the literature for solving the minimum vertex cover problem.


Joseline Manora J.,TBML College | Swaminathan V.,Ramanujan Research Center | Paulraj Jayasimman I.,Indira Institute of Engineering and Technology
IEEE-International Conference on Advances in Engineering, Science and Management, ICAESM-2012 | Year: 2012

This article deals with partitioning the vertex set V(G) into as many disjoint subsets, each being a majority dominating set with a required property. The majority domatic number d M(G) are found for some standard graphs. Some bounds and characterisations on d M(G) of a graph G are determined. © 2012 Pillay Engineering College.


Balaji S.,SASTRA University | Swaminathan V.,Ramanujan Research Center | Kannan K.,SASTRA University
International Journal of Computational and Mathematical Sciences | Year: 2010

The Minimum Weighted Vertex Cover (MWVC) problem is a classic graph optimization NP - complete problem. Given an undirected graph G = (V, E) and weighting function defined on the vertex set, the minimum weighted vertex cover problem is to find a vertex set S ⊆ V whose total weight is minimum subject to every edge of G has at least one end point in S. In this paper an effective algorithm, called Support Ratio Algorithm (SRA), is designed to find the minimum weighted vertex cover of a graph. Computational experiments are designed and conducted to study the performance of our proposed algorithm. Extensive simulation results show that the SRA can yield better solutions than other existing algorithms found in the literature for solving the minimum vertex cover problem.

Discover hidden collaborations