R. Selvakumar

Bio: R. Selvakumar is an academic researcher from VIT University. The author has contributed to research in topics: Communications system & Block code. The author has an hindex of 5, co-authored 33 publications receiving 93 citations.

The inverse strong non-split r-domination number of a graph

Abstract: In this paper, we define the notions of inverse strong non-split r-dominating set and inverse strong non-split r-domination number γ′snsr(G) of a graph G. We characterize graphs for which γsnsr(G) + γ′snsr(G) = n, where γsnsr(G) is the strong non-split r-domination number of G. We get many bounds on γ′snsr(G). Nordhaus-Gaddum type results are also obtained for this new parameter Keywords: r-independent set, r-dominating set, strong non-split r-dominating set, inverse strong non-split r-dominating set, strong non-split r-domination number and inverse strong non-split r-domination number.

Kernel code and its controllability

Abstract: A group code called Kernel code is defined Minimal Trellis of Kernel code is constructed Controllability index of Kernel code is defined It is proved that a particular type of Kernel code is 1 -controllable

Fundamental circuits and cut-sets used in cryptography

Abstract: Many network applications involve data transfer; therefore there is a need to have a secure network, which can be achieved through the use of cryptography In this paper, we present an innovative algorithm for encryption and decryption using connected graphs Message represented by a connected graph can be encrypted by using a spanning tree of the graph Any message represented in the graph is either on a branch or on a chord with respect to the spanning tree Depending whether it is a branch or a chord graph theorems are applied to the spanning tree for both encryption and decryption purposes This approach used to encrypt leads to more secure data transfer

Unconventional construction of DNA codes: Group Homomorphism

Abstract: One of the key problems in DNA computation is the design of large and reliable codes. Due to the biological and chemical restrictions, DNA codes need to satisfy certain constraints. Here, we provide an algebraic procedure to construct DNA codes by using homomorphism of groups. The construction procedure is used to determine mutation.

Random graphs

Abstract: We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

A Theory of Graphs

Abstract: A graph is just a bunch of points with lines between some of them, like a map of cities linked by roads. A rather simple notion. Nevertheless, the theory of graphs has broad and important applications, because so many things can be modeled by graphs. For example, planar graphs — graphs in which none of the lines cross are— important in designing computer chips and other electronic circuits. Also, various puzzles and games are solved easily if a little graph theory is applied.

Graphs and Digraphs

Abstract: For the list object, introduced in Chapter 5, it was shown that each data element contains at most one predecessor element and one successor element. Therefore, for any given data element or node in the list structure, we can talk in terms of a next element and a previous element.

Error-correction coding

Abstract: This report describes the progress made towards the completion of a specific task on error-correcting coding. The proposed research consisted of investigating the use of modulation block codes as the inner code of a concatenated coding system in order to improve the overall space link communications performance. The study proposed to identify and analyze candidate codes that will complement the performance of the overall coding system which uses the interleaved RS (255,223) code as the outer code.

Plant-Mediated Synthesis and Applications of Iron Nanoparticles.

Abstract: Nanoscale iron particles have attracted substantial interest due to their unique physical and chemical properties. Over the years, various physical and chemical methods have been developed to synthesize these nanostructures which are usually expensive and potentially harmful to human health and the environment. Synthesis of iron nanoparticles (INPs) by using plant extract is now of great interest in order to develop a novel and sustainable approach toward green chemistry. In this method the chemical compounds and organic solvents are replaced with phytochemicals and aqueous matrixes, respectively. Similar to any chemical and biochemical reaction, factors such as reaction temperature, concentration of iron precursor, concentration of leaf extract, and reaction time have critical effects on the reaction yield. This review focuses on the novel approaches used for green synthesis of INPs by using plant resources. The currently available statistics including the factors affecting the synthesis process and potential applications of the fabricated nanoparticles are discussed. Recommendations are also given for areas of future research in order to improve the production process.