Simon Mukwembi

Prof. Dr. Simon Mukwembi

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 September 2023 in Discrete Mathematics
Verified
Journal Article
Open access
SMSimon Mukwembi
Simon Mukwembi
Let G=(V,E) be a connected graph of order n. The distance, dG(x,y), between vertices x and y in G is defined as the length of a shortest x-y path in G. The average distance, μ(G), of G is defined as μ(G)=(n2)−1∑{x,y}⊆VdG(x,y). We give an upper bound on the average distance of a connected graph of given order and minimum degree where irregularity index is prescribed. Our results are a strengthening of the classical theorems by Kouider and Winkler (1997) [9] and by Dankelmann and Entringer (2000) [5] on average distance and minimum degree if the number of distinct terms in the degree sequence of the graph is prescribed.

12 April 2022 in Quaestiones Mathematicae
Verified
Journal Article
Closed access
PMP. Mafuta
P. Mafuta
SMSimon Mukwembi
Simon Mukwembi
SMSheunesu Munyira
Sheunesu Munyira
Let G be a simple, connected graph with minimum degree δ, radius r and leaf number L(G). We prove thatWe give similar bounds for triangle-free graphs. Infinite families of graphs are constructed to...

Verified
Journal Article
Open access
PDF file
MZMoster Zhangazha
Moster Zhangazha
AAAlex Somto Arinze Alochukwu
Alex Somto Arinze Alochukwu
EJElizabeth Jonck
Elizabeth Jonck
RMRonald John Maartens
Ronald John Maartens
EMEunice Gogo Mphako-Banda
Eunice Gogo Mphako-Banda
FNFarai Nyabadza
Farai Nyabadza
The accurate determination of bond lengths is fundamental to understanding molecular geometry and the physicochemical behavior of chemical compounds. However, obtaining these measurements is often challenging, as both experimental techniques and advanced quantum-chemical methods are complex, computationally demanding, and costly to apply across diverse molecular systems. In this work, we present a novel graph-theoretical model for predicting bond lengths in flavonoid molecules based on molecular descriptors derived from atomic and topological parameters. By integrating atomic electronegativity with graph-based descriptors, such as the weighted second-order neighborhood, the proposed model predicts the bond lengths of luteolin with a coefficient of determination of R2=0.990. This approach offers a computationally efficient and highly accurate alternative to conventional experimental and theoretical methods, providing a practical framework for bond length estimation when experimental data are unavailable.

25 August 2021 in medRxiv
Verified
Preprint
Open access
PDF file
SMSimon Mukwembi
Simon Mukwembi
FNFarai Nyabadza
Farai Nyabadza
In drug design, there are two major causes of drug failure in the clinic. First, the drug has to work, and second, the drug should be safe. Identifying compounds that work for certain ailments require enormous experimental time and, in general, is cost intensive. In this paper, we are concerned with melanoma, a special type of cancer that affects the skin. In particular, we seek to provide a mathematical model that can predict the ability of flavonoids, a vast and natural class of compounds that are found in plants, in reversing or alleviating melanoma. The basis for our model is the conception of a new graph parameter called, for lack of better terminology, graph activity, which captures melanoma cancer healing properties of the flavonoids. With a superior coefficient of determination, R 2 = 1, the new model faithfully reproduces anti-cancer activities of some known data-sets. We demonstrate that the model can be used to rank the healing abilities of flavonoids which could be a powerful tool in the screening, and identification, of compounds for drug candidates.

9 September 2026 in Mathematics
Verified
Journal Article
Open access
PDF file
MZMoster Zhangazha
Moster Zhangazha
SMSimon Mukwembi
Simon Mukwembi
FNFarai Nyabadza
Farai Nyabadza
Let G be a connected simple graph of order n≥3, and let ξc(G)=∑v∈V(G)ecG(v)degG(v) denote its eccentric connectivity index. We study the lower bounds for ξc(G) in terms of the irregularity index t(G), defined as the number of distinct vertex degrees of G. For t=t(G)≥2, we prove that ξc(G)≥3n+t2−3t−1, which reduces to the classical bound 3(n−1) when t=2, with equality attained by the star K1,n−1. We also derive refined bounds when the minimum degree δ or maximum degree Δ is prescribed, distinguishing between graphs with and without a universal vertex. The proofs use degree-sequence constraints together with lower estimates for vertex eccentricities. These results clarify how the number of distinct degrees influences the eccentric connectivity index and provide new lower bounds for connected graphs.

2 January 2023 in AKCE International Journal of Graphs and Combinatorics
Verified
Journal Article
Open access
PMP. Mafuta
P. Mafuta
SMSimon Mukwembi
Simon Mukwembi
We give a tight upper bound on the average distance of a connected graph of given order in terms of its connected domination number. Our results are a strengthening of a result by DeLaViña, Pepper, and Waller [A note on dominating sets and average distance, Discrete Mathematics 309 (2009) 2615–2619] on average distance and connected domination number.