REJI KUMAR K
Verified email at yahoo.co.in
Assistant Professor in Mathematics
N S S College, Kerala University
K. Reji Kumar, Ph. D.
Assistant Professor and the Head of the Department
P. G. Department of Mathematics
N. S. S. College, Cherthala
Kochuramapuram (P.O.) Alappuzha
PIN: 689 501
rkkmaths@yahoo.co.in
rkkresearch@yahoo.co.in
PROFESSIONAL RESEARCH EXPERIENCE
• Awarded summer research fellowship of Indian Academy of Sciences and did post-doctoral
research in Indian Statistical Institute, at the Delhi center for two months (1st April 2007 to 30th May 2007), under the supervision of Prof. R. B. Bapat.
• Did post-doctoral research in Dept. of Mathematics and Statistics, University of
Victoria, Canada, from 1st April 2008 to 1st November 2008. I got the BOYSCAST fellowship of the Department of Science and Technology, India.
EDUCATION
MSc (Mathematics), MA (Philosophy), B. Ed,
M. Phil (Applied Mathematics), Ph. D (Mathematics)
RESEARCH INTERESTS
Graph Theory, Discrete Mathematics, Mathematical Modeling, Consciousness Research
FUTURE PROJECTS
Mathematical Modeling of Consciousness
The aim of the project is to develop a mathematical theory of Human Consciousness. An axiomatic approach to the study of consciousness is already under consideration. According to this theory, models form the basic units of consciousness. There are three types of models
Applications Invited
Collaborators
Domination in Graph Theory and Related Topics
Domination is an established area of research in Graph Theory. The project aims at further research in this area.
Applications Invited
Collaborators
Mathematics for Social Change and Development
Mathematics is not a subject just for study and teaching. It has the fascinating potential of applications in all fields of knowledge. This project aims at exploring all such possibilities.
Applications Invited
Collaborators
Scopus Publications
Scholar Citations
Scholar h-index
Scholar i10-index
Scopus Publications
K. Reji Kumar, C. M. Indukala, and E. N. Satheesh
Lecture Notes in Electrical Engineering, ISSN: 18761100, eISSN: 18761119, Volume: 711, Pages: 349-358, Published: 2021
Springer Singapore
K. Reji Kumar and E.N. Satheesh
Journal of Physics: Conference Series, ISSN: 17426588, eISSN: 17426596, Volume: 1706, Published: 22 December 2020
IOP Publishing
Abstract An eternal 1-secure set, in a graph G = (V, E) is a set D ⊂ V having the property that for any finite sequence of vertices r 1, r 2,…,rk , there exists a sequence of vertices v 1,v 2,…,vk and a sequence D = D 0, D 1, D 2,…, Dk of dominating sets of G, such that for each i, 1 ⩾ i ⩾ k, Di = (D i-1 − {vi }) ∪ {ri }, where vi ∈ D i−1, and ri ∈ N[vi ], where ri = vi is possible. The cardinality of a smallest eternal 1 - secure set in a graph G is called the eternal 1 - security number of G. This situation can be interpreted as defending an attack at the place ri by moving a guard from vi to ri , where guards are deployed at the places, which are represented by the vertices in D i−1. An eternal m - secure set is defined in a similar way with only one exception that in response to an attack more than one guards can move to its adjacent locations to defend an attack. A vertex is safe eternal m - secure if it is either adjacent to exactly one vertex in an eternal m - secure set or present in the set itself. In this paper we study some properties of safe eternal m - secure sets. Safe eternal m - security number (σsm ) is the minimum cardinality of all safe eternal m - secure sets in a graph. We also find the safe eternal m - security number of some classes of graphs.
K Reji Kumar and E N Satheesh
IOP Conference Series: Materials Science and Engineering, ISSN: 17578981, eISSN: 1757899X, Volume: 872, Published: 26 June 2020
IOP Publishing
K. Reji Kumar and Shibu Manuel
Lecture Notes on Data Engineering and Communications Technologies, ISSN: 23674512, eISSN: 23674520, Pages: 344-352, Published: 2020
Springer International Publishing
Identifying important nodes in a network is an important area of research in network science. m-ranking method is a method proposed Reji Kumar et al. [18] for ranking the nodes in a network which avoids the chance of assigning same rank for two nodes with different physical characteristics. This ranking takes into account the degree of all nodes and weights of all edges in a network. As the network becomes bigger and bigger the m-ranking method takes more and more time to complete. To overcome this difficulty in this paper we propose an approximation to this method, which simplifies the calculations without undermining the ranking outcome. We illustrate the procedure in some example networks.
K. Reji Kumar and Shibu Manuel
Lecture Notes on Data Engineering and Communications Technologies, ISSN: 23674512, eISSN: 23674520, Pages: 585-590, Published: 2020
Springer International Publishing
In this paper we compare the performance made by higher educational institutions in Kerala (a southern state in India) in the field Mathematical research for the period from 1981 to 2015. The entire period is conveniently divided into periods of five years. We use some techniques from social network analysis to compare the performance of institutions over time. His study is based on the research papers published by the faculty of the institutions in the national and international journals which are indexed and listed by MatScinet of American Mathematical Society, which is a prominent abstracting agency in the field of Mathematics. Data available in the data base of MatScinet is used to prepare the network of collaborations of the institutions. These networks are further analyzed and compared to arrive at many valuable conclusions.
K. Reji Kumar and Shibu Manuel
Scientometrics, ISSN: 01389130, eISSN: 15882861, Volume: 117, Pages: 1041-1051, Published: 1 November 2018
Springer Science and Business Media LLC
Expansion of knowledge in the realm of higher mathematics is highly important when progress of human society is concerned. As a fast developing country, in India we need a monitoring system which would tell us the exact nature of changes taking place in the field of mathematics. This is the motivation behind this paper. In this paper we present an analysis of the network formed by institutions which conduct research and publish articles in the field of Mathematics. Collaboration between a member of one institute and a member of another institute make a connection between the institutions. We make a comparative study of the network formed in consecutive years over a period of time giving emphasis to importance of institutions in the research network.
K. Reji Kumar and S. A. Naisal
2016 International Conference on Control Instrumentation Communication and Computational Technologies, ICCICCT 2016, Pages: 147-152, Published: 21 July 2017
IEEE
In this paper we define some properties of soft multi sets. We also define soft multi set topology, its interior, exterior, boundary and their properties. We discuss mathematical modeling of spacial objects using fuzzy soft interior, fuzzy soft exterior, fuzzy soft boundary. A decision making problem is also included. Main aim of this study is to give an extension of the existing studies of special objects and to give better result using fuzzy soft set theory. An application of fuzzy concepts and the topological interior, exterior, and boundary is clearly available [11] in the literature. Here we find the maximum affected area of Mikania micrantha using interior, boundary and exterior by taking row maximum and row minimum using the numerical value of resultant fuzzy soft sets. It also provides conceptual definition and explanation along with a quantitative description of topological aspects between spacial objects.
K. Reji Kumar, Shibu Manuel, and Deepu Benson
2017 9th International Conference on Communication Systems and Networks, COMSNETS 2017, Pages: 413-414, Published: 9 June 2017
IEEE
Identifying influential nodes in complex networks has attracted much attention because of its great theoretical significance and wide application. The m-Ranking method takes into account degree of all nodes and weight of all edges to rank nodes of the network with different weight. This ranking method can be used for unweighted networks also by fixing the value of the parameter α = 1. In addition, we demonstrate our new method on a real air traffic network and show that the ranks calculated using the new method is more meaningful compared with other methods.
Rejikumar Karunakaran and Shibu Manuel
Proceedings of IEEE International Conference on Emerging Technological Trends in Computing, Communications and Electrical Engineering, ICETT 2016, Published: 7 March 2017
IEEE
Spreading information in complex networks is studied by researchers using methods such as k — shell decomposition, degree k, closeness centrality etc. In this paper we discuss the importance of increase in degree of vertiees in a network in spreading information. We also pinpoint some important flaws in the existing methods and propose a modified method to do the identification of the most influential nodes as spreaders.
Rejikumar Karunakaran
Proceedings of IEEE International Conference on Emerging Technological Trends in Computing, Communications and Electrical Engineering, ICETT 2016, Published: 7 March 2017
IEEE
Human consciousness is modeled mathematically, using models as fundamental units [6]. It is hypothesized that consciousness is the effect of all model based activities taking place in our mind. In this paper we initiate a study to explain how the complex phenomenon of consciousness evolves from a very simple, fundamental level.
K. Reji Kumar
Proceedings of IEEE International Conference on Circuit, Power and Computing Technologies, ICCPCT 2016, Published: 2 August 2016
IEEE
In this article, our research focuses on the subjectivity of human experiences. We discuss the possible reasons for subjectivity and present a mathematical model which explains this phenomenon. Also an objective way to measure the subjectivity of human thinking is introduced.
International Journal of Pure and Applied Mathematics, ISSN: 13118080, eISSN: 13143395, Volume: 106, Pages: 33-43, Published: 2016
K. Reji Kumar and Gary MacGillivray
Discrete Mathematics, ISSN: 0012365X, Volume: 313, Pages: 767-771, Published: 2013
Elsevier BV
Abstract Results about wreath products of circulant graphs are used to construct infinitely many circulant graphs with efficient dominating sets whose elements need not be equally spaced in Z n . It is proved that if a circulant graph of large degree has an efficient dominating set, then either its elements are equally spaced, or the graph is the wreath product of a smaller circulant graph with an efficient dominating set and a complete graph.
Journal of Combinatorial Mathematics and Combinatorial Computing, ISSN: 08353026, Pages: 213-223, Published: February 2011
K.Reji Kumar and Gary MacGillivray
Discussiones Mathematicae - Graph Theory, ISSN: 12343099, Pages: 407-423, Published: 2010
Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Gora
In this paper we study some of the structural properties of the set of all minimal total dominating functions (FT ) of cycles and paths and introduce the idea of function reducible graphs and function separable graphs. It is proved that a function reducible graph is a function separable graph. We shall also see how the idea of function reducibility is used to study the structure of FT (G) for some classes of graphs.
Vijay Kumar and Kuldeep Kumar
Information Sciences, ISSN: 00200255, Volume: 178, Pages: 4670-4678, Published: 15 December 2008
Elsevier BV
In this paper we introduce and study the concepts of I-convergence, I^*-convergence and I-Cauchy sequence for sequences of fuzzy numbers where I denotes the ideal of subsets of N, the set of positive integers.
Utilitas Mathematica, ISSN: 03153681, Pages: 235-247, Published: November 2008
Ars Combinatoria, ISSN: 03817032, Pages: 205-212, Published: April 2008