Time filter

Source Type

Chennai, India

Muthu M.,Konkuk University | Vimala A.,Indian Institute of Technology Madras | Mendoza O.H.,Stella Maris College | Gopal J.,Konkuk University
TrAC - Trends in Analytical Chemistry | Year: 2016

Surface-enhanced laser desorption/ionization time of flight mass spectrometry (SELDI-TOF MS) has been established as a powerful analytical tool for biomarker discovery in oncology. This review visits the milestones achieved by this technique and scans the advantages and limitation of the technique as well. The need for expanding this technique for biomarker discovery with respect to diseases other than cancer has been emphasized. The future of this technique and its application to clinical research has been highlighted to have hit a dead-end. This review is an eye opener to break the silence, amidst the analytical chemists for revival of this technique, breaking barriers in its application to clinical research. © 2015 Elsevier B.V. Source

Arockiaraj M.,Loyola College | Shalini A.J.,Stella Maris College
Match | Year: 2016

A topological index is a numeric quantity associated with a graph which characterize the topology of graph and is invariant under graph automorphism. In this paper we extend the well known cut method to certain distance and degree based topological indices such as edge Wiener, Schultz and Gutman indices. As applications, we compute these indices for regular and irregular convex triangular hexagon. Source

Rajasingh I.,Vellore Institute of Technology | Shanthi A.S.,Stella Maris College | Muthumalai A.,Loyola College
Journal of Discrete Algorithms | Year: 2015

A matching in a graph G=(V,E) is a subset M of edges, no two of which have a vertex in common. A matching M is said to be perfect if every vertex in G is an endpoint of one of the edges in M. The excessive index of a graph G is the minimum number of perfect matchings to cover the edge set of G. In this paper we determine the excessive index for mesh, cylinder and torus networks. © 2014 Elsevier B.V. Source

Arockiaraj M.,Loyola College | Shalini A.J.,Stella Maris College
Theoretical Computer Science | Year: 2015

In the paper of Manuel et al. [8] the minimum wirelength of embedding hypercube into cylinder and torus were given as conjectures. In a recent paper of Rajan et al. [11] these conjectures have been proved. But there are logical flaws in the proof of lower bound of two conjectures and a constructional flaw in the upper bound of wirelength of hypercube into cylinder. In this paper we correct the constructional flaw and could not fix the logical flaws. © 2015 Elsevier B.V. Source

Manuel P.,Kuwait University | Shanthi A.S.,Stella Maris College
Mathematics in Computer Science | Year: 2015

A snark is a connected, bridgeless cubic graph with chromatic index equal to 4. The Berge–Fulkerson conjecture proposed in 1971 states that every bridgeless cubic graph contains a family of six perfect matchings such that each edge is contained in exactly two of them. This conjecture holds trivialy for 3-edge colorable graphs. Thus a possible minimum counterexample for the conjecture is a snark. In this paper we shown that the conjecture holds for families of snarks such as Loupekhine snarks of first and second kind and the Watkins snark. We also determine the excessive index for Loupekhine snarks of first and second kind. © 2015, Springer Basel. Source

Discover hidden collaborations