Browsing Department of Mathematics Staff Publications by Title

Now showing items 9-14 of 14

    • A Note on the Discrete Spectrum of Gaussian Wells (I): The Ground State Energy in One Dimension 

      Muchatibaya, Gift; Fassari, S.; Rinaldi, F.; Mushanyu, Josiah (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 ...

    • Spanning paths in graphs 

      Mafuta, Phillip; Mukwembi, Simon; Munyira, Sheunesu (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. ...

    • Transmission dynamics of schistosomiasis in Zimbabwe: A mathematical and GIS approach. 

      Ngarakana-Gwasira, Ethel T.; Bhunu, Claver P.; Masocha, Mhosisi; Mashonjowa, Emmanuel (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 ...

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

      Myer, T G; Mitchell, S L; Muchatibaya, Gift (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 ...

    • An Upper Bound on the Radius of a 3-Vertex-Connected C4-Free Graph 

      Fundikwa, Blessings T.; Mazorodze, Jaya P.; Mukwembi, Simon (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 

      Fundikwa, Blessings T.; Mazorodze, Jaya P.; Mukwembi, Simon (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 ...