https://www.rgnpublications.com/journals/index.php/cma/issue/feedCommunications in Mathematics and Applications2021-07-17T06:10:21+00:00The Head, Editorial Sectioneditorial@rgnpublications.comOpen Journal SystemsAuthors who publish with this journal agree to the following terms:<br /><ul><li>Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.</li><li>Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.</li><li>Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.</li></ul><p style="line-height: 1.5;">The “<strong>Communications in Mathematics and Applications</strong>” (CMA) is an international journal devoted to the publication of original and high-quality research of <strong>Pure and Applied Mathematics</strong>. <span>The journal “Communications in Mathematics and Applications”</span><span> (CMA) is being regularly published since 2010.</span></p><p style="line-height: 1.5;">The<strong> "<strong>Communications in Mathematics and Applications"</strong></strong> covers the following subject fields (but not limited to):</p><table width="622" border="0" cellspacing="2" cellpadding="2"><tbody><tr><td valign="top"><span style="font-family: Helvetica, Arial, sans-serif;"><strong>Pure Mathematics</strong><br /> </span></td><td valign="top"><span style="font-family: Helvetica, Arial, sans-serif;"><strong>Applied Mathematics</strong><br /> </span></td></tr><tr><td valign="top" width="250"><ul><li><span style="font-family: Helvetica, Arial, sans-serif;">Algebra</span></li><li><span style="font-family: Helvetica, Arial, sans-serif;">Algebraic Geometry</span></li><li><span style="font-family: Helvetica, Arial, sans-serif;">Analysis</span></li><li><span style="font-family: Helvetica, Arial, sans-serif;">Category Theory</span></li><li><span style="font-family: Helvetica, Arial, sans-serif;">Graph Theory</span></li><li><span style="font-family: Helvetica, Arial, sans-serif;">Mathematical Logic & Foundations</span></li><li><span style="font-family: Helvetica, Arial, sans-serif;">Number Theory</span></li><li><span style="font-family: Helvetica, Arial, sans-serif;">Philosophy of Mathematics</span></li><li><span style="font-family: Helvetica, Arial, sans-serif;">Topology <br /> </span></li></ul></td><td valign="top" width="350"><ul><li><span style="font-family: Helvetica, Arial, sans-serif;">Information Theory</span></li><li><span style="font-family: Helvetica, Arial, sans-serif;">Mathematical Physics </span></li><li><span style="font-family: Helvetica, Arial, sans-serif;">Numerical Analysis</span></li><li><span style="font-family: Helvetica, Arial, sans-serif;">Operations Research</span></li><li><span style="font-family: Helvetica, Arial, sans-serif;">Probability Theory</span></li><li><span style="font-family: Helvetica, Arial, sans-serif;">Computational Biology</span></li><li><span style="font-family: Helvetica, Arial, sans-serif;">Physical Applied Mathematics</span></li><li><span style="font-family: Helvetica, Arial, sans-serif;">Statistics</span></li><li><span style="font-family: Helvetica, Arial, sans-serif;">Computer Science: Algorithms and complexity, Architecture and organization, Computational science, Graphics and visual computing, Human-computer interaction, Information management, Intelligent systems, Networking and communication, Parallel and distributed computing, Platform-based development, Security and information assurance, Software engineering</span></li></ul></td></tr></tbody></table><p style="line-height: 1.5;">To ensure speedy publication, only articles that are sufficiently well presented, containing significant results, and not required major revisions will be considered. Articles are accepted only after peer review.</p><p style="line-height: 1.5;">Editorial decisions on the acceptance or otherwise are taken normally within 8 to 12 weeks (three months) of receipt of the article. <br />The journal is also publishing survey articles giving details of research progress made during the last three decades in a particular area.</p><p style="line-height: 0.25;"><img src="/journals/public/site/images/ganesh/hbar.png" alt="" width="6000" height="24" /></p>https://www.rgnpublications.com/journals/index.php/cma/article/view/1470Best Proximity Points for Cyclic Contractions in CAT(0) Spaces2021-07-13T11:48:42+00:00Jamnian Nantadilokjamnian2010@gmail.comChainarong Khunpanukiprove2000ck@gmail.comIn this manuscript, we establish best proximity point results for some cyclic contraction maps. We discuss the existence and convergence of best proximity point results for such maps in CAT(0) spaces.2021-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1505Fractional Variational Iteration Method and Adomian’s Decomposition Method: Applications to Fractional Burgers Kuramoto KdV Equation via Hadamard Derivative2021-07-13T11:48:42+00:00Djeriba Hichemdjeriba.hichem@edu.univ-oran1.dzBelghaba Kacembelghaba.kacem@univ-oran1.dz<p>This paper presents the analytical solutions of the Fractional Burgers Kuramoto KdV equation by the variational iteration method and Adomian’s decomposition method using Hadamard fractional derivative. By using initial conditions, the explicit solutions of the Burgers Kuramoto Kdv equation have been presented. The fractional derivatives are considered according to the Hadamard’s approach. Two examples are given for illustrate to implement variational iteration method and Adomian’s decomposition method for fractional Burgers Kuramoto KdV equation.</p>2021-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1462Four New Sums of Second Hyper Zagreb Index Based on Cartesian Product2021-07-13T11:48:42+00:00M. Aruviaruvim.aut@gmail.comJ. Maria Josephjoseph80john@gmail.comE. Ramganesheramganesh68@gmail.com<p>In this work, we study the second hyper Zagreb index of new operations of different subdivisions graphs related to Cartesian product of graphs.</p>2021-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1513Automorphism Group of Dihedral Groups With Perfect Order Subsets2021-07-13T11:48:42+00:00Vinod S.wenod76@gmail.comBiju G. S.gsbiju@cet.ac.inLet \(G\) be a finite group. The set of all possible such orders joint with the number of elements that each order referred to, is called the order classes of \(G\). The order subset of \(G\) determined by \(x\in G\) is the set of elements in \(G\) with the same order as \(x\). A group is said to have perfect order subsets (POS-group) if the cardinality of each order subset divides the group order. In this paper, we compute the order classes of the automorphism group of Dihedral group. Also, we construct a class of POS groups from the automorphism group of the Dihedral group which will serve the solution to the Perfect Order Subset Conjecture.2021-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1464Composite Weiner Hopf Equation with Variational Inequality and Equilibrium Problem2021-07-17T06:10:21+00:00Savita Ratheedr.savitarathee@gmail.comMonika Swamimonikaswami06@gmail.com<p>In this paper, we introduce an iteration based on compositeWeiner-Hopf equation technique to find the common solution of the set of solution of composite generalized variational inequality, set of equilibrium problem and set of fixed point of non expansive mapping in separable real Hilbert space. As the result, the strong convergence theorem of the suggested iteration has been discussed.</p>2021-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1479A Fuzzy Soft Set Theoretic Approach in Decision Making of Covid-19 Risk in Different Regions2021-07-13T11:48:42+00:00Anurag Awasthianuragawasthi425@gmail.comSudhir Kumar Srivastavasudhir.mathstat@ddugu.ac.in<p>In the present paper, we apply the theory of fuzzy soft sets to solve a decision making problem related to Covid-19. We give an example which shows that the method can be successfully applied to the burning problem of Covid-19 that contains uncertainties and find result regarding to the risk of Covid-19 in particular region.</p>2021-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1490On Rings Whose Quasi-Projective Modules Are Projective or Semisimple2021-07-13T11:48:42+00:00Nil Orhan Ertasorhannil@yahoo.comUmmahan Acaruacar@mu.edu.trFor two modules \(M\) and \(N\), \(P_M(N)\) stands for the largest submodule of \(N\) relative to which \(M\) is projective. For any module \(M\), \(P_M(N)\) defines a left exact preradical. It is given some properties of \(P_M(N)\).\ We express \(P_M(N)\) as a trace submodule. In this paper, we study rings with no quasi-projective modules other than semisimples and projectives, that is, rings whose quasi-projectives are either projective or semisimple (namely <em>QPS</em>-<em>ring</em>). Semi-Artinian rings and rings with no right p-middle class are characterized by using this functor: a ring \(R\) right semi-Artinian if and only if for any right \(R\)-module \(M\), \(P_M(M)\leq_e M\).2021-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1495Common Fixed Point Theorem in a Multiplicative <it>S</it>-Metric Space With an Application2021-07-13T11:48:42+00:00Prasad Kanchanapallyiitm.prasad@gmail.comV. Naga Rajuiitm.prasad@gmail.com<p>In this paper, we introduce multiplicative \(S\)-metric space as a generalization of multiplicative \(d\)-metric space and investigate its some topological properties. Further, we establish a common fixed point theorem for a pair of self maps in the framework of multiplicative \(S\)-metric space with an application. This result generalizes some fixed point results in the current literature. Finally, we provide an example in support of the result.</p>2021-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1507Effect of Torsional Loading in an Axisymmetric Micro-Isotropic, Micro-Elastic Solid2021-07-13T11:48:42+00:00E. Ramaramamathsou@gmail.com<p>In this paper, an attempt is made to obtain the solution for the problem of torsional loading in an axisymmetric Micro-isotropic, Micro-elastic half-space under the action of an arbitrary load on its boundary. The components of displacement, microrotation, stress, couple stress and stress moment are obtained. These components are also obtained for a particular type of twist and represented graphically in the positive quadrant.</p>2021-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1489Characterizations of Some Regularities in Ordered Ternary Semigroups in Terms of Fuzzy Subsets2021-07-13T11:48:42+00:00Nareupanat Lekkoksungnareupanat.le@rmuti.ac.thHataokhan Sanpanhataikhan.sa@rmuti.ac.thSomsak Lekkoksunglekkoksung_somsak@hotmail.com<p>Characterizations of some classes of ordered ternary semigroups; left (resp., right) lightly regular and generalized regular are given in terms of fuzzy left ideals, fuzzy right ideals, fuzzy lateral ideals, and fuzzy ideals of ordered ternary semigroups.</p>2021-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1510Solving Fuzzy Linear Programming Problem Using Defuzzification Method2021-07-13T11:48:42+00:00Nalla Veerrajuveerrajunalla@gmail.comV. Lakshmi Prasannamdrvlp@rediffmail.com<p>Linear Programming (LP) has been one of the efficient, reliable and time tested techniques in Optimization. Conventional LP is not suitable for many real time problems which involve data with inherent vagueness or impreciseness. Fuzzy set theory is proved to be quite good in addressing the inherent vagueness or impreciseness and thus Fuzzy Linear Programming (FLP) is brought to light and developed over the years. A quite good number of techniques have been proposed for solving FLP problems to obtain optimal solution for real world problems involving fuzzy (vague or imprecise) environment. In this paper, “Extended Geometric Mean Defuzzification” is defined and based on it, a method is proposed for solving FLP problems. To showcase the advantages of the proposed method, different problems of FLP, available in the literature, are discussed. Numerical comparisons are also provided to validate the authentication of the proposed method.</p>2021-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1384Translation Surfaces in the 3-Dimensional Pseudo-Galilean Space Satisfying: \(\boldsymbol{\bigtriangleup^{\mathrm{II}}\, r_i=\lambda_i r_i}\)2021-07-13T11:48:42+00:00Azzi Ahmedazzi.mat@hotmail.frBekkar Mohammedbekkar_99@yahoo.frZoubir Hanifizoubirhani@yahoo.fr<p>In this paper, we classify translation surfaces in a \(3\)-dimensional Pseudo-Galilean space \(\mathbb{G}_{3}^1\) under the condition \(\bigtriangleup^{\rm II}\, r_i=\lambda_i r_i\), where \(r_i\) are the components of the position vector, \(\lambda_i\in\mathbb{R}\), \((i=1,2,3)\), and \(\bigtriangleup^{\rm II}\) denotes the Laplace operator with respect to the second fundamental form.</p>2021-06-30T05:50:44+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1494Fair Distribution Heuristics for Parallel Processors2021-07-13T11:48:42+00:00Mohammad Mahmood Otoomm.otoom@mu.edu.sa<p>This paper studies the machine covering problem to satisfy the fair distribution of several tasks with different execution times to be run on several parallel processors. My work deals with process scheduling on identical parallel processors and how to find the best solution to this problem. The goal is to maximize the finishing time for the processor with the least time regarding all other system processors. Some algorithms were proposed that can approximately solve the studied problem by minimizing the difference between the finishing time of all processors in the system.</p>2021-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1606Idempotents and Ideals of Regular Rings2021-07-13T11:48:42+00:00Preethi C.S.preethi.uni@gmail.comJeeja A.V.jeejaarun@gmail.comVinod S.wenods@gmail.com<p>Multiplicative semigroups of rings form an important class of semigroups and one theme in the study of semigroups is how the structure of this semigroup affects the structure of the ring. An important tool in analyzing the structure of a semigroup is the Green’s relations. We study some properties of these relations on the multiplicative semigroup of a regular ring with unity. This also gives easier proofs of some known results on ring theory.</p>2021-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1436Stability Results of Solution of Non-Homogeneous Impulsive Retarded Equation Using the Generalized Ordinary Differential Equation2021-07-14T06:13:11+00:00D. K. Igobidodiigobi@gmail.comLucky Igbinosunlukyigbinoson@gmail.comJeremiah Atsuatsujeremiah@gmail.com<p>This work is devoted to the study of a non-homogeneous impulsive retarded equation with bounded delays and variable impulse time using the generalized ordinary differential equations (GODEs). The integral solution of the system satisfying the Caratheodory and Lipschitz conditions obtained using the fundamental matrix theorem is embedded in the space of the generalized ordinary differential equations and investigate the problem of stability of the system in the Lyapunov sense. In particular, results on the necessary and sufficient conditions for stability and asymptotic stability of the impulsive retarded system via the generalized ordinary differential equation are obtained. An example is used to illustration the derived theory.</p>2021-06-30T00:00:00+00:00