Elizabeth Jonck

Prof. Elizabeth Jonck


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
21 March 2024 in Quaestiones Mathematicae
Verified
Journal Article
Closed access
Alex AlochukwuAlex Alochukwu
Alex Alochukwu
MDM. Dorfling
M. Dorfling
EJElizabeth Jonck
Elizabeth Jonck
An i-packing in a graph G is a set of vertices that are pairwise at distance more than i. A packing colouring of G is a partition X = {X1, X2, . . . , Xk } of V(G) such that each colour class Xi is...

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.

8 February 2020 in arXiv
Verified
Preprint
Open access
PDF file
PDPeter Dankelmann
Peter Dankelmann
EJElizabeth Jonck
Elizabeth Jonck
SMSonwabile Mafunda
Sonwabile Mafunda
Let $G$ be a finite, connected graph. The average distance of a vertex $v$ of $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The remoteness $\rho(G)$ and the proximity $\pi(G)$ of $G$ are the maximum and the minimum of the average distances of the vertices of $G$. In this paper, we present a sharp upper bound on the remoteness of a triangle-free graph of given order and minimum degree, and a corresponding bound on the proximity, which is sharp apart from an additive constant. We also present upper bounds on the remoteness and proximity of $C_4$-free graphs of given order and minimum degree, and we demonstrate that these are close to being best possible.