A.Elakkiya

@sairamit.edu.in

Assistant professor, Mathematics
Sri Sairam institute of technology

RESEARCH, TEACHING, or OTHER INTERESTS

Mathematics, Applied Mathematics, Algebra and Number Theory, Analysis
12

Scopus Publications

Scopus Publications

  • Chromatic polynomial of domination subdivision non stable graphs
    , A. Elakkiya, M. Yamuna, and
    International Journal of Innovative Technology and Exploring Engineering, 2019
    A graph G is said to be domination subdivision non stable ( DSNS ) if  ( Gsduv ) =  ( G ) + 1 for all u, v  V ( G ), u adjacent to v. In this paper, we provide a method of determining the chromatic polynomial of DSNS graph from G.
  • γ-chromatic partition in planar graph characterization
    M. Yamuna, A. Elakkiya
    Trends in Mathematics, 2019
  • Review on mathematical models in drug discovery, development and treatments of various diseases
    M Yamuna, A Elakkiya
    Research Journal of Pharmacy and Technology, 2018
    Drug is considered as one of the most important necessity to all of us. A mathematical model plays an important role in drug development and drug discovery. In this short survey we have presented a brief note on the contribution of mathematical models to drug discovery, development and several therapies.
  • Mathematical models in drug discovery, development and treatment of various diseases – A case study
    M Yamuna, A Elakkiya
    Research Journal of Pharmacy and Technology, 2017
    Drug is considered as one of the most important necessity to all of us. A mathematical model plays an important role in drug development and drug discovery. In this short survey we have presented a brief note on the contribution of mathematical models to drug discovery, development and several therapies.
  • Planar graph characterization of γ - Uniquely colorable graphs
    M Yamuna, A Elakkiya
    Iop Conference Series Materials Science and Engineering, 2017
    A graph G = ( V, E ) is uniquely colorable if the chromatic number χ ( G ) = n and every n – coloring of G induces the same partition of V. Uniquely colorable graphs whose chromatic partition contains at least one γ - set is γ - uniquely colorable graphs In this paper, we characterize the planarity of γ - uniquely colorable graphs.
  • Non - Domination subdivision stable graphs
    M Yamuna, A Elakkiya
    Iop Conference Series Materials Science and Engineering, 2017
    Subdividing an edge in the graph may increase the domination number or remains the same. In this paper, we introduce a new kind of graph called non - domination subdivision stable graph (NDSS). We obtain a necessary and sufficient condition for a graph to be NDSS. We provide a constructive characterization of NDSS trees and a MATLAB program for identifying NDSS graphs.
  • Planar graph characterization of NDSS graphs
    M Yamuna, A Elakkiya
    Iop Conference Series Materials Science and Engineering, 2017
    Planar graph characterization is always of interest due to its complexity in characterization. In this paper, we obtain a necessary and sufficient condition for a graph to be NDSS and hence characterize the planarity and outer – planarity of its complement G¯.
  • γ - Uniquely colorable graphs
    M Yamuna, A Elakkiya
    Iop Conference Series Materials Science and Engineering, 2017
    A graph G = ( V, E ) is uniquely colorable if the chromatic number χ ( G ) = n and every n – coloring of G induces the same partition of V. In this paper, we introduce a new kind of graph called γ - uniquely colorable graphs. We obtain a necessary and sufficient condition for a graph to be γ - uniquely colorable graphs. We provide a constructive characterization of γ - uniquely colorable trees.
  • Development of alternate fault tolerant minimum weighted spanning tree using vertex, edge connectivity
    International Journal of Pharmacy and Technology, 2016
  • Position matrix in DNA sequence alignment with gaps
    Der Pharmacia Lettre, 2015
  • Periodic table in medical molecular formula safe transfer
    Der Pharmacia Lettre, 2015
  • Chemical equation representation as directed graph
    Der Pharma Chemica, 2015