https://www.rgnpublications.com/journals/index.php/cma/issue/feedCommunications in Mathematics and Applications2020-06-30T17:52:45+00:00Head, 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><span>The journal “<strong>Communications in Mathematics and Applications”</strong></span><span> (CMA) is being regularly published since 2010. </span><span>The “</span><strong>Communications in Mathematics and Applications</strong><span>” is an international journal devoted to the publication of original and high-quality research of pure mathematics.</span></p><p><strong>Subjects covered by <strong>Communications in Mathematics and Applications</strong>: </strong></p><ul><li><strong>Algebra <br /></strong></li><li><strong>Algebraic Geometry <br /></strong></li><li><strong>Analysis <br /></strong></li><li><strong>Category Theory <br /></strong></li><li><strong>Graph Theory <br /></strong></li><li><strong>Mathematical Logic & Foundations <br /></strong></li><li><strong>Number Theory <br /></strong></li><li><strong>Philosophy of Mathematics <br /></strong></li><li><strong>Topology</strong></li></ul><p>To ensure speedy publication, only articles which are sufficiently well presented, containing significant results and not required major revisions will be considered. The papers are accepted only after peer review.</p><p>Editorial decisions on acceptance or otherwise are taken within 4 to 8 weeks (two months) of receipt of the paper.</p><p>The journal will also publish survey articles giving details of research progress made during the last three decades in a particular area.</p><p><img src="/journals/icons/cma/icore.jpg" alt="" /></p>https://www.rgnpublications.com/journals/index.php/cma/article/view/1237Fixed Point Theorems for a Demicontractive Mapping and Equilibrium Problems in Hilbert Spaces2020-06-30T17:52:43+00:00Wongvisarut Khuangsatungwongvisarut_k@rmutt.ac.thSarawut Suwannautsarawut-suwan@hotmail.co.th<p>In this research, we introduce some properties of demicontractive mapping and the combination of equilibrium problem. Then, we prove a strong convergence for the iterative sequence converging to a common element of fixed point set of demicontractive mapping and a common solution of equilibrium problems. Finally, we give a numerical example for the main theorem to support our results.</p>2020-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1335Common Fixed Point Results for Three Multivalued \(\rho\)-Nonexpansive Mappings by Using Three Steps Iterative Scheme2020-06-30T17:52:44+00:00Reena Morwalmorwal80@gmail.comAnju Panwaranjupanwar15@gmail.com<p>The purpose of this research paper is to study the convergence and approximation of common fixed points for three multivalued \(\rho\)-nonexpansive mappings for three steps iterative scheme in modular function spaces. Further we construct a numerical example which illustrates our results.</p>2020-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1348On Eigenvalues of Hermitian-Adjacency Matrix2020-06-30T17:52:44+00:00Olayiwola Babarinsaolayiwola@umk.edu.myAzfi Zaidi Mohammad Sofiazfi.ms@umk.edu.myMohd Asrul Hery Ibrahimhery.i@umk.edu.myHailiza Kamarulhailibabs3in1@gmail.comDlal Bashirdlalmahmud@yahoo.com<p>The graph of Hermitian-adjacency matrix is a mixed graph consisting adjacency matrix of an undirected graph and skew-adjacency matrix of a digraph. In this paper we discuss eigenvalues of Hermitian-adjacency matrix. Then we use the eigenvalues to determine the possible Hamiltonian cycles of its graph.</p>2020-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1332All 2-potent Elements in \(\mathit{Hyp}_G(2)\)2020-06-30T17:52:44+00:00Apatsara Sareetochannypooii@gmail.comSorasak Leeratanavaleesorasak.l@cmu.ac.th<p align="LEFT">A generalized hypersubstitution of type \(\tau = (2)\) is a function which takes the binary operation symbol \(f\) to the term \(\sigma(f)\) which does not necessarily preserve the arity. Let \(Hyp_{G}(2)\) be the set of all these generalized hypersubstitutions of type \((2)\). The set \(Hyp_{G}(2)\) with a binary operation and the identity generalized hypersubstitution forms a monoid. The <em>index</em> and <em>period</em> of an element \(a\) of a finite semigroup are the smallest values of \(m\geq1\) and \(r\geq1\) such that \(a^{m+r}=a^m\). An element with the index \(m\) and period 1 is called an $m$-potent element. In this paper we determine all \(2\)-potent elements in \(Hyp_{G}(2)\).</p>2020-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1321Characterizing Almost Quasi-\(\Gamma\)-ideals and Fuzzy Almost Quasi-\(\Gamma\)-ideals of \(\Gamma\)-semigroups2020-06-30T17:52:44+00:00Anusorn Simuenasimuen96@gmail.comKhwancheewa Wattanatripopkhwancheewa12@gmail.comRonnason Chinramronnason.c@psu.ac.th<p>In this paper, we dene the concepts of almost quasi-\(\Gamma\)-ideals and almost quasi-\(\Gamma\)-ideals of a \(\Gamma\)-semigroup. Moreover, we give some relationship between almost quasi-\(\Gamma\)-ideals and fuzzy almost quasi-\(\Gamma\)-ideals of \(\Gamma\)-semigroups.</p>2020-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1330A New Approach to Multivalued Certain Contraction Mappings2020-06-30T17:52:44+00:00Cafer Aydıncaydin61@gmail.comSeher Sultan Yeşilkayasultanseher20@gmail.com<p>In the submit study, we establish the notion of generalization of partial Hausdorff metric space. Also, we state an extension of the concept of \(f\)-weak compatibility of Pathak [12] on metric space in generalization of partial metric space. We introduced some common fixed point theorems for multivalued mappings satisfying generalized weak contraction conditions on a complete \(G_p\) metric spaces. Also, a example is given to illustrate the main theorem. Further, our theorems generalize several formerly obtained fixed point results.</p>2020-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1319Vertex and Edge Connectivity of the Zero Divisor graph \(\Gamma[\mathbb{Z}_n]\)2020-06-30T17:52:44+00:00B. Surendranath Reddysurendra.phd@gmail.comRupali S. Jainrupalisjain@gmail.comN. Laxmikanthlaxmikanth.nandala@gmail.com<p>The Zero divisor Graph \(\Gamma[R]\) of a commutative ring \(R\) is a graph with vertex set being the set of non-zero zero divisors of \(R\) and there is an edge between two vertices if their product is zero. In this paper, we prove that the vertex, edge connectivity and the minimum degree of the zero divisor graph \(\Gamma[\mathbb{Z}_n]\) for any natural number \(n\), are equal.</p>2020-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1356Multiple Intruder Locating Dominating Sets in Graphs: An Algorithmic Approach2020-06-30T17:52:44+00:00K. Venugopalvenugopalk@rvce.edu.inK. A. Vidyavidya.mnj@gmail.comA set \(S\subseteq V\) of vertices (called codewords) of a graph \(G=(V, E)\) is called a Multiple Intruder Locating Dominating set (<em>MILD</em> set) if every non-codeword \(v\) is adjacent to at least one codeword \(u\) which is not adjacent to any other non-codeword. This enables one to locate intruders at multiple locations of a network and hence the name. The \(MILD(G)\) is the minimum cardinality of a \(MILD\) set in \(G\). Here, we show that the problem of finding MILD set for general graphs is NP-Complete. Further, we provide a linear time algorithm to find the MILD number of trees through dynamic programming approach and then, we extend the algorithm for unicyclic graphs.2020-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1328Spectral Analysis of Klein-Gordon dierence operator given by a general boundary condition2020-06-30T17:52:44+00:00Nihal Yokusnyokus@kmu.edu.trNimet Coskuncannimet@kmu.edu.tr<p>In this study, we consider the spectral properties of the non-selfadjoint difference operator \(L\) generated in \(l_2(\mathbb{N})\) by the difference expression $$ \Delta (a_{n-1}\Delta y_{n-1})+(v_n-\lambda)^2y_n=0, \ \ n \in \mathbb{N},$$ and a general boundary condition $$\sum^\infty_{n=0} h_ny_n=0,$$ where \(a_0 = 1\), \(h_0\neq 0\) and \(\{a_n\}^\infty_{n=1}\), \(\{v_n\}^\infty_{n=1}\) and \(\{h_n\}^\infty_{n=1}\) are complex sequences and \(\{h_n\}^\infty_{n=1}\in l_1(\mathbb{N})\). Along with the designation of the sets of eigenvalues and spectral singularities of the operator \(L\), we investigate the quantitative properties of these sets under certain conditions using the uniqueness theorems of analytic functions.</p>2020-06-30T00:00:00+00:00https://www.rgnpublications.com/journals/index.php/cma/article/view/1102Matrix Sequences of Tribonacci and Tribonacci-Lucas Numbers2020-06-30T17:52:44+00:00Yüksel Soykanyuksel_soykan@hotmail.com<p>In this paper, we define Tribonacci and Tribonacci-Lucas matrix sequences and investigate their properties.</p>2020-06-30T00:00:00+00:00