Sonwabile Mafunda

most citedProximity and Remoteness in Directed and Undirected Graphs

1 citations · 3 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2021★ 1 cited

On the difference between proximity and other distance parameters in triangle-free graphs and $C_{4}$ -free graphs

Peter Dankelmann, Sonwabile Mafunda

The average distance of a vertex $v$ of a connected graph $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$ . The proximity $π (G)$ and the remoteness…

math.CO2020★ 1 cited

An Extremal Problem on Rainbow Spanning Trees in Graphs

Matthew DeVilbiss, Bradley Fain, Amber Holmes +3

A spanning tree of an edge-colored graph is rainbow provided that each of its edges receives a distinct color. In this paper we consider the natural extremal problem of maximizing…

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…

math.CO2020★ 1 cited

Proximity and Remoteness in Directed and Undirected Graphs

Jiangdong Ai, Stefanie Gerke, Gregory Gutin +1

Let $D$ be a strongly connected digraph. The average distance $σ ˉ (v)$ of a vertex $v$ of $D$ is the arithmetic mean of the distances from $v$ to all other vertices of $D$ . The r…

On the difference between proximity and other distance parameters in triangle-free graphs and C4​-free graphs

An Extremal Problem on Rainbow Spanning Trees in Graphs

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

Proximity and Remoteness in Directed and Undirected Graphs

On the difference between proximity and other distance parameters in triangle-free graphs and $C_{4}$ -free graphs