E. Jonck

collaborators

2 papers

math.CO2023

On uniquely packable trees

A. Alochukwu, M. Dorfling, E. Jonck

An $i$ -packing in a graph $G$ is a set of vertices that are pairwise distance more than $i$ apart. A \emph{packing colouring} of $G$ is a partition $X = {X_{1}, X_{2}, \dots, X_{k}}$ …

math.CO2020

Proximity and remoteness in triangle-free and C_4-free graphs in terms of order and minimum degree

Peter Dankelmann, Elizabeth Jonck, 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 $ρ(G…