Ronald John Maartens

Dr. Ronald John Maartens

orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
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.

10 October 2025 in Afrika Matematika
Verified
Journal Article
Open access
PDF file
LBLiam B. Baker
Liam B. Baker
JKJonathan Kariv
Jonathan Kariv
RMRonald John Maartens
Ronald John Maartens
Let G be a nontrivial connected graph with an edge coloring, and let $$u,v \in V(G)$$ . A $$u-v$$ path in G is said to be a rainbow path if no color is repeated on the edges of the path. Similarly, we define a rainbow geodesic . A rainbow connected graph G is a graph with an edge coloring such that every two vertices in G are connected by a rainbow path. Further, a strong rainbow connected graph G is a graph with an edge coloring such that every two vertices in G is connected by a rainbow geodesic. The minimum number of colors needed to make a graph rainbow connected is called the rainbow connection number , denoted $${{\,\textrm{rc}\,}}(G)$$ , and the minimum number of colors needed to make a graph strong rainbow connected is called the strong rainbow connection number , denoted $${{\,\textrm{src}\,}}(G)$$ . In this paper we determine $${{\,\textrm{rc}\,}}(G)$$ and $${{\,\textrm{src}\,}}(G)$$ when G is a n -dimensional rectangular grid graph, triangular grid graph, hexagonal grid graph, and a (weak) Bruhat graph, respectively. We show for all these families that $${{\,\textrm{src}\,}}(G)={{\,\textrm{diam}\,}}(G)$$ .