OFFERED

Asst. Professor, Mathematics, School of Engineering, Coimbatore

Qualification:

Ph.D, MPhil, MSc

Google Scholar Profile:

Email:

r_radhaiyer@cb.amrita.edu

Dr. Radha Iyer R. currently serves as Assistant Professor (SG) in the Department of Mathematics, School of Engineering, Coimbatore Campus. Her areas of research include Graph Theory.

Year of Publication | Publication Type | Title |
---|---|---|

2017 |
Journal Article |
Va Anandkumar and Dr. Radha Iyer R., “On the hyper-zagreb index of some operations on graphs”, International Journal of Pure and Applied Mathematics, vol. 112, pp. 239-252, 2017.[Abstract] Let G be any (molecular) graph. The hyper-Zagreb index of a graph was intro- duced and studied by G.H Shirdel and H.Rezapour[22]. In this paper some exact expressions for the hyper-Zagreb index of four graph operations(F-sums) of a graph are established. ©2017 Academic Publications, Ltd. More »» |

2014 |
Journal Article |
Dr. Radha Iyer R. and Kulli, V. R., “Total Closed Neighbourhood Graphs with Crossing Numbers One and Two”, Pacific - Asian Journal of Mathematics, vol. 8, pp. 71–78, 2014. |

2014 |
Journal Article |
A. Kumar and Dr. Radha Iyer R., “The Inverse Vertex Domination Number and Independence Number of Some Cubic Bipartite Graphs”, Advanced Modeling and Optimization, vol. 16, pp. 331–338, 2014. |

2012 |
Journal Article |
A. Ganesan and Dr. Radha Iyer R., “The regular number of a graph”, Journal of Discrete Mathematical Sciences and Cryptography, vol. 15, pp. 149–157, 2012.[Abstract] Let be a simple undirected graph. The regular number of is defined to be the minimum number of subsets into which the edge set of can be partitioned so that the subgraph induced by each subset is regular. In this work, we obtain the regular number of some graphs and obtain some bounds on this parameter. Also, some of the bounds proved in [5] are shown here to hold with equality. More »» |

2012 |
Journal Article |
V. R. Kulli and Dr. Radha Iyer R., “Inverse vertex covering number of a graph”, Journal of Discrete Mathematical Sciences and Cryptography, vol. 15, pp. 389–393, 2012.[Abstract] Let G = (V, E) be a graph. Let D be a minimum vertex covering of G. If V – D contains a vertex cover D’ of G, then D’ is called an inverse vertex cover with respect to D. The inverse vertex covering number of G is the minimum cardinality of an inverse vertex cover of G. In this paper, we initiate a study of this new parameter and establish some results on this parameter. More »» |

2012 |
Journal Article |
Dr. Radha Iyer R., “The Total Minimal Dominating Graph, Advances in Domination Theory I”, Vishwa International Publications, 2012. |

2012 |
Journal Article |
Dr. Radha Iyer R., “THE TOTAL MINIMAL DOMINATING GRAPH”, 2012. |

2011 |
Journal Article |
Dr. Radha Iyer R. and Kulli, V. R., “The Split Edge Domination Number of a Graph”, Ultra Scientist, vol. 23, pp. 190–194, 2011. |

2007 |
Journal Article |
V. R. Kulli and Dr. Radha Iyer R., “Inverse total domination in graphs”, Journal of Discrete Mathematical Sciences and Cryptography, vol. 10, pp. 613–620, 2007.[Abstract] Let G=(V, E) be a graph. Let D be a minimum total dominating set of G. If V–D contains a total dominating set D’ of G, then D’ is called an inverse total dominating set with respect to D. The inverse total domination number of G is the minimum number of vertices in an inverse total dominating set of G. We initiate the study of inverse total domination in graphs and present some bounds and some exact values for . Also, some relationships between and other domination parameters are established. More »» |

2005 |
Journal Article |
Dr. Radha Iyer R., “Women entrepreneurs in the NGO sector in India”, 2005.[Abstract] This paper addresses the role of socioeconomic and environmental factors involved in Women leading the Entrepreneurial activity in the Non Government Organisations. It seeks to provide an idea-bank for potential entrepreneurs in this sector as it may be the logical career choice in the third millennium. This paper highlights the critical success factors that relate to building, nurturing, and sustenance of a NGO. It brings out the importance of role of the family, role models, passion for the cause, education and relentless dedication that contribute to the success of women as social entrepreneurs. More »» Women Entrepreneurs |

2001 |
Journal Article |
V. R. Kulli, Janakiram, A., and Dr. Radha Iyer R., “Regular number of a graph”, Journal of Discrete Mathematical Sciences and Cryptography, vol. 4, pp. 57–64, 2001.[Abstract] The regular number r(G) of a graph G is the minimum number of subsets into which the edge set of G should be partitioned so that the subgraph induced by each subset is regular. In this chapter some results regarding the regular number r(G) of a graph are established. Also a new parameter edge set independence number of a graph G is defined. More »» |

1999 |
Journal Article |
V. R. Kulli, Janakiram, B., and Dr. Radha Iyer R., “The cototal domination number of a graph”, Journal of Discrete Mathematical Sciences and Cryptography, vol. 2, pp. 179–184, 1999.[Abstract] A dominating set D of a graph G = (V,E) is a cototal dominating (c.t.d.) set if every vertex v ∈ V−D is not an isolated vertex in the induced subgraph V − D>. The cototal domination number γcl (G) of G is the minimum cardinality of a c.t.d. set. The cototal domatic number dCt (G) of G is defined like domatic number d(G). In this paper, we establish some results concerning these parameters. More »» |

1998 |
Journal Article |
V. R. Kulli, Janakiram, B., and Dr. Radha Iyer R., “Split bondage numbers of a graph”, Journal of Discrete Mathematical Sciences and Cryptography, vol. 1, pp. 79–84, 1998.[Abstract] Let G = (V, E) be a graph. The negative split bondage number of G is the minimum cardinality among all sets of edges X ⊂ E such that γ s (G − S) < γ s (G) and the split bondage number bs (G) of G is the minimum cardinality among all sets of edges X ⊂ E such that γ s (G − X) > γ s (G), where γ s (G) is the split domination number of G. In this paper, we initiate a study of these two new parameters. More »» |

Faculty Research Interest:

207

PROGRAMS

OFFERED

OFFERED

5

AMRITA

CAMPUSES

CAMPUSES

15

CONSTITUENT

SCHOOLS

SCHOOLS

A

GRADE BY

NAAC, MHRD

NAAC, MHRD

9^{th}

RANK(INDIA):

NIRF 2017

NIRF 2017

150^{+}

INTERNATIONAL

PARTNERS

PARTNERS