Now showing items 1-14 of 14

• Unsteady contact melting of a rectangular cross section material on a flat plate. ﻿

(American Institute of Physics, 2008-10-06)
The work in this paper concerns a mathematical model of the contact melting process of a rectangular material in contact with a hot plate. The problem is described by a coupled system of heat equations in the solid and ...
• Modeling gonorrhea and HIV co-interaction. ﻿

(Elsevier, 2010-09-14)
A mathematical model was designed to explore the co-interaction of gonorrhea and HIV in the presence of antiretroviral therapy and gonorrhea treatment. Qualitative and comprehensive mathematical techniques have been used ...
• Minimum degree, leaf number and traceability ﻿

(Institute of Mathematics of the Czech Academy of Sciences, 2013-03-26)
Let G be a finite connected graph with minimum degree δ. The leaf number L (G) of G is defined as the maximum number of leaf vertices contained in a spanning tree of G. We prove that if δ >12(L (G) + 1), then G is 2-connected. ...
• Application of citrus sinensis solid waste as a pseudo- catalyst for free cyanide conversion under alkaline conditions ﻿

(BioResources, 2013-05-08)
In this study, Citrus sinensis (C. sinensis) solid waste was used to catalyze the conversion of free cyanide (F-CN) under alkaline conditions; conditions which represent most industrial wastewater containing F-CN. Acid ...
• Assessing the impact of drug resistance on the transmission dynamics of Typhoid fever. ﻿

(Hindawi, 2013-05-20)
Typhoid fever continues to be a major public health problem in the developing world. Antibiotic therapy has been the main stay of treating typhoid fever for decades. The emergence of drug-resistant typhoid strain in the ...
• Average distance and edge-connectivity I ﻿

(Society for Industrial and Applied Mathematics, 2015-01-15)
The average distance $\mu(G)$ of a connected graph G of order n is the average of the distances between all pairs of vertices of G. We prove that if G is a $\lambda$-edge-connected graph of order n, then the bounds \$\mu(G) ...
• Transmission dynamics of schistosomiasis in Zimbabwe: A mathematical and GIS approach. ﻿

(Elsevier, 2015-11-15)
Temperature and presence of water bodies are known to influence the transmission dynamics of schistosomiasis. In this work, effects of water bodies (taken in context of rainfall patterns)and temperature from 1950 to 2000 ...
• The Gutman Index and the Edge-Wiener Index of Graphs with given Vertex-Connectivity ﻿

(University of Zielona Góra, 2015-12-30)
The Gutman index and the edge-Wiener index have been extensively investigated particularly in the last decade. An important stream of re- search on graph indices is to bound indices in terms of the order and other parameters ...
• A Note on the Discrete Spectrum of Gaussian Wells (I): The Ground State Energy in One Dimension ﻿

(Hindawi Publishing Corporation, 2016-02-07)
The ground state energy 𝐸 0(𝜆) of 𝐻 𝜆 = − 𝑑 2 /𝑑𝑥 2 − 𝜆 𝑒 −𝑥2 is computed for small values of 𝜆 by means of an approximation of an integral operator in momentum space. Such an approximation leads to a transcendental ...
• Assessing the role of climate change in Malaria transmission in Africa. ﻿

(HINDAWI, 2016-02-23)
The sensitivity of vector borne diseases like malaria to climate continues to raise considerable concern over the implications of climate change on future disease dynamics. The problem of malaria vectors shifting from their ...
• Modelling gender differences in drug abuse epidemics. ﻿

(Springer, 2018-01-11)
Drug abuse is an issue of considerable concern due to its association with numerous public health problems. Mathematical models developed to describe the spread of drug abuse have generally assumed that the dynamics of ...
• Spanning paths in graphs ﻿

(Elsevier, 2018-08-29)
The Conjecture, Graffiti.pc 190, of the computer program Graffiti.pc, instructed by DeLavi˜na, state that every simple connected graph G with minimum degree δ and leaf number L(G) such that δ ≥ 1 2 (L(G) + 1), is traceable. ...
• An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph ﻿

(HINDAWI, 2020-08-04)
Let G=(V,E) be a finite, connected, undirected graph with vertex set V and edge set E. -e distance dG (u,v) between two vertices u, v of G is the length of a shortest u-v path in G.-e eccentricity ec(v)of a vertex v∈V is ...
• Upper Bounds on the Diameter of Bipartite and Triangle-Free Graphs with Prescribed Edge Connectivity ﻿

(HINDAWI, 2020-09-03)
Graph theory is used to study the mathematical structures of pairwise relations among objects. Mathematically, a pair G=(V,E) is a crisp graph, where V is a nonempty set and E is a relation on V[1]. -e order of a graph G ...