http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
( Ponraj Ganesh Prabu ),( Selvi Sabhanayakam ),( Veeranarayanan Mathivanan ),( Dhananjayan Balasundaram ) 한국잠사학회 2011 International Journal of Industrial Entomology Vol.22 No.2
To evaluate the growth rate of larval and pupal parameters of silkworm Bombyx mori fed with Silver Nanoparticles (AgNps) treated MR2 mulberry leaves, the following works have been considered. The AgNp was synthesized by chemical reduction method, it was diluted by different concentrations such as 25%, 50%, 75% and 100% (without dilution). Fresh mulberry leaves (Morus alba L.) were sprayed by each concentration and were fed to silkworms, from 3rd, 4th and 5th instar, five feedings/day. Group T1 larvae received MR2 mulberry leaves sprayed with distilled water and served as control, group T2, T3, T4 and T5 larvae received 25%, 50%, 75% and 100% AgNps sprayed mulberry leaves, respectively. Silkworm larvae fed on M. alba (MR2) leaves sprayed with 25% concentration of AgNps (group T2) was significantly increased the larvae and cocoon length, width and weight as compared to those fed on control (group T1) MR2 mulberry leaves and other groups (T3, T4 and T5). Hence, 25% AgNps dose was fixed as an effective dose. It has been observed from the present study that 25% AgNps treated (group T2) leaves fed by silkworms have enhanced the larval and pupal growth and quantity of silk production than control.
PONRAJ, R.,SINGH, RAJPAL,KALA, R.,NARAYANAN, S. SATHISH The Korean Society for Computational and Applied M 2016 Journal of applied mathematics & informatics Vol.34 No.3
In this paper we introduce a new graph labeling called k-prime cordial labeling. Let G be a (p, q) graph and 2 ≤ p ≤ k. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called a k-prime cordial labeling of G if |v<sub>f</sub> (i) − v<sub>f</sub> (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |e<sub>f</sub> (0) − e<sub>f</sub> (1)| ≤ 1 where v<sub>f</sub> (x) denotes the number of vertices labeled with x, e<sub>f</sub> (1) and e<sub>f</sub> (0) respectively denote the number of edges labeled with 1 and not labeled with 1. A graph with a k-prime cordial labeling is called a k-prime cordial graph. In this paper we investigate the k-prime cordial labeling behavior of a star and we have proved that every graph is a subgraph of a k-prime cordial graph. Also we investigate the 3-prime cordial labeling behavior of path, cycle, complete graph, wheel, comb and some more standard graphs.
ON 4-TOTAL MEAN CORDIAL GRAPHS
PONRAJ, R.,SUBBULAKSHMI, S.,SOMASUNDARAM, S. The Korean Society for Computational and Applied M 2021 Journal of applied mathematics & informatics Vol.39 No.3
Let G be a graph. Let f : V (G) → {0, 1, …, k - 1} be a function where k ∈ ℕ and k > 1. For each edge uv, assign the label $f(uv)={\lceil}{\frac{f(u)+f(v)}{2}}{\rceil}$. f is called k-total mean cordial labeling of G if ${\mid}t_{mf}(i)-t_{mf}(j){\mid}{\leq}1$, for all i, j ∈ {0, 1, …, k - 1}, where t<sub>mf</sub> (x) denotes the total number of vertices and edges labelled with x, x ∈ {0, 1, …, k-1}. A graph with admit a k-total mean cordial labeling is called k-total mean cordial graph.
PAIR MEAN CORDIAL LABELING OF GRAPHS OBTAINED FROM PATH AND CYCLE
PONRAJ, R.,PRABHU, S. The Korean Society for Computational and Applied M 2022 Journal of applied and pure mathematics Vol.4 No.3/4
Let a graph G = (V, E) be a (p, q) graph. Define $${\rho}\;=\;\{\array{{\frac{p}{2}}&p\text{ is even}\\{\frac{p-1}{2}}\;&p\text{ is odd,}}$$ and M = {±1, ±2, ⋯ ± 𝜌} called the set of labels. Consider a mapping λ : V → M by assigning different labels in M to the different elements of V when p is even and different labels in M to p - 1 elements of V and repeating a label for the remaining one vertex when p is odd. The labeling as defined above is said to be a pair mean cordial labeling if for each edge uv of G, there exists a labeling $\frac{{\lambda}(u)+{\lambda}(v)}{2}$ if λ(u) + λ(v) is even and $\frac{{\lambda}(u)+{\lambda}(v)+1}{2}$ if λ(u) + λ(v) is odd such that ${\mid}\bar{\mathbb{S}}_{{\lambda}_1}-\bar{\mathbb{S}}_{{\lambda}^c_1}{\mid}{\leq}1$ where $\bar{\mathbb{S}}_{{\lambda}_1}$ and $\bar{\mathbb{S}}_{{\lambda}^c_1}$ respectively denote the number of edges labeled with 1 and the number of edges not labeled with 1. A graph G for which there exists a pair mean cordial labeling is called a pair mean cordial graph. In this paper, we investigate the pair mean cordial labeling of graphs which are obtained from path and cycle.
4-TOTAL DIFFERENCE CORDIAL LABELING OF SOME SPECIAL GRAPHS
PONRAJ, R.,PHILIP, S. YESU DOSS,KALA, R. The Korean Society for Computational and Applied M 2022 Journal of applied and pure mathematics Vol.4 No.1/2
Let G be a graph. Let f : V (G) → {0, 1, 2, …, k-1} be a map where k ∈ ℕ and k > 1. For each edge uv, assign the label |f(u) - f(v)|. f is called k-total difference cordial labeling of G if |t<sub>df</sub> (i) - t<sub>df</sub> (j) | ≤ 1, i, j ∈ {0, 1, 2, …, k - 1} where t<sub>df</sub> (x) denotes the total number of vertices and the edges labeled with x. A graph with admits a k-total difference cordial labeling is called k-total difference cordial graphs. In this paper we investigate the 4-total difference cordial labeling behaviour of shell butterfly graph, Lilly graph, Shackle graphs etc..
Analysis of Multi-Input Multilevel Boost Inverter Circuit with Optimal Firing Angles Using dSPACE
Ponraj Ram Prakash,Sigamani Titus,Ravindran Vijay 대한전기학회 2023 Journal of Electrical Engineering & Technology Vol.18 No.2
The DC load utilities are increased due to the modern development of alternate renewable Energy sources and Electric Vehicles. Contemporary applications like Electric Vehicles require multiple voltages that require separate DC-DC converters. Usage of more power electronic converters for multiple loads leads to more harmonics and high switching loss. To minimize the losses and improve efficiency, this paper presents a new multilevel inverter topology with multiple outputs and multiple inputs. This circuit combines a multi-input multistage DC-DC converter for various DC voltage levels and a level shifter circuit with H-Bridge. The performance of the circuit was analysed using Phase opposition and disposition modulation and optimal firing angle PWM techniques. Pulses for DC-DC converter and multilevel inverter are generated using MATLAB/Simulink environment and integrated with hardware prototype using dSPACE- ds1104 interface.
DIFFERENCE CORDIALITY OF SOME SNAKE GRAPHS
Ponraj, R.,Narayanan, S. Sathish The Korean Society for Computational and Applied M 2014 Journal of applied mathematics & informatics Vol.32 No.3
Let G be a (p, q) graph. Let f be a map from V (G) to {1, 2, ${\ldots}$, p}. For each edge uv, assign the label ${\mid}f(u)-f(\nu){\mid}$. f is called a difference cordial labeling if f is a one to one map and ${\mid}e_f(0)-e_f(1){\mid}{\leq}1$ where $e_f(1)$ and $e_f(0)$ denote the number of edges labeled with 1 and not labeled with 1 respectively. A graph with admits a difference cordial labeling is called a difference cordial graph. In this paper, we investigate the difference cordial labeling behavior of triangular snake, Quadrilateral snake, double triangular snake, double quadrilateral snake and alternate snakes.
TOTAL MEAN CORDIAL LABELING OF SOME CYCLE RELATED GRAPHS
Ponraj, R.,Narayanan, S. Sathish The Korean Society for Computational and Applied M 2015 Journal of applied mathematics & informatics Vol.33 No.1
A Total Mean Cordial labeling of a graph G = (V, E) is a function $f:V(G){\rightarrow}\{0,1,2\}$ such that $f(xy)={\Large\lceil}\frac{f(x)+f(y)}{2}{\Large\rceil}$ where $x,y{\in}V(G)$, $xy{\in}E(G)$, and the total number of 0, 1 and 2 are balanced. That is ${\mid}ev_f(i)-ev_f(j){\mid}{\leq}1$, $i,j{\in}\{0,1,2\}$ where $ev_f(x)$ denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). If there is a total mean cordial labeling on a graph G, then we will call G is Total Mean Cordial. Here, We investigate the Total Mean Cordial labeling behaviour of prism, gear, helms.
SOME 4-TOTAL PRIME CORDIAL LABELING OF GRAPHS
PONRAJ, R.,MARUTHAMANI, J.,KALA, R. The Korean Society for Computational and Applied M 2019 Journal of applied mathematics & informatics Vol.37 No.1
Let G be a (p, q) graph. Let $f:V(G){\rightarrow}\{1,2,{\ldots},k\}$ be a map where $k{\in}{\mathbb{N}}$ and k > 1. For each edge uv, assign the label gcd(f(u), f(v)). f is called k-Total prime cordial labeling of G if ${\mid}t_f(i)-t_f(j){\mid}{\leq}1$, $i,j{\in}\{1,2,{\ldots},k\}$ where $t_f$(x) denotes the total number of vertices and the edges labelled with x. A graph with a k-total prime cordial labeling is called k-total prime cordial graph. In this paper we investigate the 4-total prime cordial labeling of some graphs.
Ponraj, Rubha,Kannan, Aravindaraj G.,Ahn, Jun Hwan,Kim, Dong-Won American Chemical Society 2016 ACS APPLIED MATERIALS & INTERFACES Vol.8 No.6
<P>Trapping lithium polysulfides formed in the sulfur positive electrode of lithium-sulfur batteries is one of the promising approaches to overcome the issues related to polysulfide dissolution. In this work, we demonstrate that intrinsically hydrophilic magnesium oxide (MgO) nanoparticles having surface hydroxyl groups can be used as effective additives to trap lithium polysulfides in the positive electrode. MgO nanoparticles were uniformly distributed on the surface of the active sulfur, and the addition of MgO into the sulfur electrode resulted in an increase in capacity retention of the lithium-sulfur cell compared to a cell with pristine sulfur electrode. The improvement in cycling stability was attributed to the strong chemical interactions between MgO and lithium polysulfide species, which suppressed the shuttling effect of lithium polysulfides and enhanced the utilization of the sulfur active material. To the best of our knowledge, this report is the first demonstration of MgO as an effective functional additive to trap lithium polysulfides in lithium-sulfur cells.</P>