Open Journal of Mathematical Sciences (OMS)

Open Journal of Mathematical Sciences (OMS) 2523-0212 (online) 2616-4906 (Print) partially supported by National Mathematical Society of Pakistan is a single blind peer reviewed Open Access journal that publishes original research articles, review articles and survey articles related to Mathematics. Open access means that articles published in Open Journal of Mathematical Sciences are available online to the reader “without financial, legal, or technical barriers”. We publish both in print and online versions. Accepted paper will be published online immediately after it gets ready to publish. We publish one volume in the month of December in print form.

Latest Published Articles

Author(s): Abayomi Samuel OKE1, Oluwafemi Isaac BADA2
1Department of Mathematical Sciences, Adekunle Ajasin University, P.M.B. 001, Akungba Akoko, Ondo State, Nigeria.
2Department of Mathematical Sciences, University of Benin, P.M.B. 1154, Benin City, Nigeria.
Abstract:

Since the emergence of the avian influenza A(H7N9) in the year 2013 in China, several researches have been carried out to investigate the spread. In this paper, a mathematical model describing the transmission dynamics of avian influenza A(H7N9) between human and poultry proposed by Li et al. [1] is modified by introducing re-infections into the susceptible human compartment. The method of next generation matrix is used to calculate the reproduction number. We also establish the local and global stability of the equilibria using Lyapunov functions. Finally, we use numerical simulations to validate our results.

Author(s): Aqsa Shah,1, Syed Ahtsham Ul Haq Bokhary1
1Centre of Advance Studies in Pure and Applied Mathematics, Bahauddin Zakariya University, Multan, Pakistan.
Abstract:

Let \(G\) be a simple graph with vertex set \(V(G)\) and edge set \(E(G)\). A mapping \(g:V (G)\rightarrow\{1,2,…t\}\) is called \(t\)-coloring if for every edge \(e = (u, v)\), we have \(g(u) \neq g(v)\). The chromatic number of the graph \(G\) is the minimum number of colors that are required to properly color the graph. The chromatic polynomial of the graph \(G\), denoted by \(P(G, t)\) is the number of all possible proper coloring of \(G\). Dendrimers are hyper-branched macromolecules, with a rigorously tailored architecture. They can be synthesized in a controlled manner either by a divergent or a convergent procedure. Dendrimers have gained a wide range of applications in supra-molecular chemistry, particularly in host guest reactions and self-assembly processes. Their applications in chemistry, biology and nano-science are unlimited. In this paper, the chromatic polynomials for certain families of dendrimer nanostars have been computed.

Author(s): Wasim Iqbal1, Khalid Mahmood Awan2, Atiq Ur Rehman3, Ghulam Farid3
1COMSATS University Islamabad,Park Road, Tarlai Kalan, Islamabad, Pakistan.
2Department of Mathematics, University of Sargodha, Sargodha, Pakistan.
3COMSATS University Islamabad, Attock Campus, Kamra Road, Attock, Pakistan.
Abstract:

In this paper, Petrović’s inequality is generalized for \(h-\)convex functions on coordinates with the condition that \(h\) is supermultiplicative. In the case, when \(h\) is submultiplicative, Petrović’s inequality is generalized for \(h-\)concave functions. Also particular cases for \(P-\)function, Godunova-Levin functions, \(s-\)Godunova-Levin functions and \(s-\)convex functions has been discussed.

Author(s): Enqiang Zhu1, Chanjuan Liu2
1nstitute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China.
2School of Computer Science and Technology, Dalian University of Technology, Dalian 116024, China.
Abstract:

Inspired by the observation that adjacent vertices need possess their own characteristics in terms of total coloring, we study the smarandachely adjacent vertex total coloring (abbreviated as SAVTC) of a graph \(G\), which is a proper total coloring of \(G\) such that for every vertex \(u\) and its every neighbor \(v\), the color-set of \(u\) contains a color not in the color-set of \(v\), where the color-set of a vertex is the set of colors appearing at the vertex or its incident edges. The minimum number of colors required for an SAVTC is denoted by \(\chi_{sat}(G)\). Compared with total coloring, SAVTC would be more likely to be developed for potential applications in practice. For any graph \(G\), it is clear that \(\chi_{sat}(G)\geq \Delta(G)+2\), where \(\Delta(G)\) is the maximum degree of \(G\). We, in this work, analyze this parameter for general subcubic graphs. We prove that \(\chi_{sat}(G)\leq 6\) for every subcubic graph \(G\). Especially, if \(G\) is an outerplanar or claw-free subcubic graph, then \(\chi_{sat}(G)=5\).

Author(s): Sandra Pinelas1, Shyam Sundar Santra2,3
1Academia Militar, Departamento de Ciencias Exactas e Naturais, Av. Conde Castro Guimaraes, 2720-113, Amadora, Portugal.
2Department of Mathematics, Sambalpur University, Sambalpur 768019, India.
3Department of Mathematics, JIS College of Engineering, Kalyani 741235, India.
Abstract:

In this paper, new sufficient conditions are obtained for oscillation of second-order neutral delay differential equations of the form \(\frac{d}{dt} \Biggl[r(t) \frac{d}{dt} \biggl [x(t)+p(t)x(t-\tau)\biggr]\Biggr]+q(t)G\bigl(x(t-\sigma_1)\bigr)+v(t)H\bigl(x(t-\sigma_2)\bigr)=0, \;\; t \geq t_0,\) under the assumptions \(\int_{0}^{\infty}\frac{d\eta}{r(\eta)}=\infty\) and \(\int_{0}^{\infty}\frac{d\eta}{r(\eta)}<\infty\) for \(|p(t)|<+\infty\). Two illustrative examples are included.

Author(s): Meseyeki Saiguran1, Arne Ring2, Abdullahi Ibrahim3
1Department of Mathematical Sciences, St. John’s University of Tanzania, Tanzania.
2 Department of Mathematics, University of the Free State, South Africa.
3Department of Mathematical Sciences, Baze University Abuja, Nigeria.
Abstract:

This study investigate movements of molecule on the biological cell via the cell walls at any given time. Specifically, we examined the movement of a particle in tiling, i.e. in hexagonal and square tiling. The specific questions we posed includes (i) whether particles moves faster in hexagonal tiling or in square tiling (ii) whether the starting point of particles affect the movement toward attainment of stationary distribution. We employed the transitional probabilities and stationary distribution to derive expected passage time to state \(j\) from state \(i\), and the expected recurrence time to state \(i\) in both hexagonal and square tiling. We also employed aggregation of state symmetries to reduce the number of state spaces to overcome the problems (i.e. the difficulty to perform algebraic computation) associated with large transition matrix. This approach leads to formation of a new Markov chain \(X_t\) that retains the original Markov chains properties, i.e. by aggregation of states with the same stochastic behavior to the process. Graphical visualization for how fast the equilibrium is attained with different values of the probability parameter \(p\) in both tilings is also provided. Due to difficulties in obtaining some analytical results, numerical simulation were performed to obtains useful results like expected passage time and recurrence time.

Author(s): Anuraag Bukkuri1
1Department of Mathematics, University of Minnesota, Minneapolis, MN 55455, USA.
Abstract:

The author considers a mathematical model of immunotherapy and anti-angiogenesis inhibitor therapy for cancer patients over a fixed time horizon. Disease dynamics are captured by a system of ODEs developed in [1], describing dynamics among host cells, cancer cells, endothelial cells, effector cells, and anti-angiogenesis. Existence, uniqueness, and characterization of optimal treatment profiles that minimize the tumor and drug usage, while maintaining healthy levels of effector and host cells are determined. A theoretical analysis is performed to characterize the optimal control. Numerical simulations are performed to illustrate optimal control profiles for a variety of different patients, each leading to different treatment protocols.

Author(s): Annamalai Anguraj1, Ravi Kumar1
1 Department of Mathematics, PSG College of Arts and Science, Coimbatore 641 046, India.
Abstract:

The objective of this paper is to investigate the existence and uniqueness theorem for stochastic partial differential equations with poisson jumps and delays. The existence of mild solutions of the problem is studied by using a different resolvent operator defined in [1] and fixed point theorem.

Author(s): Hilal Essaouini1, Pierre Capodanno2
1Abdelmalek Essaâdi University, Faculty of Sciences, M2SM ER28/FS/05, 93030 Tetuan, Morocco.
2Université de Franche-Comté, 2B-Rue des Jardins, F- 25000 Besançon, France.
Abstract:

In this work, we study the small oscillations of a system formed by an elastic container with negligible density and a heavy barotropic gas (or a compressible fluid) filling the container. By means of an auxiliary problem, that requires a careful mathematical study, we deduce the problem to a problem for a gas only. From its variational formulation, we prove that is a classical vibration problem.

Author(s): Alaa Kamal1,2, Taha Ibrahim Yassen3
1Port Said University, Faculty of Science, Department of Mathematics Port Said, {42511,} Egypt.
2 Qassim University, College of Sciences and Arts in Muthnib, Department of Mathematics, {51431,} KSA.
3The Higher Engineering Institute in Al-Minia, Mania,{61111,} Egypt.
Abstract:

In this paper we define a new class of hyperholomorphic functions, which is known as \(F^{\alpha}_{G}(p,q,s)\) spaces. We characterize hyperholomorphic functions in \(F^{\alpha}_{G}(p,q,s)\) space in terms of the Hadamard gap in Quaternion analysis.