Sufiyan Mallu

activity

20222025

most citedProximity, remoteness and maximum degree in graphs

2 citations · 2 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2025

Remoteness, order, size and connectivity constraints in digraphs

Sufiyan Mallu

Let $ D $ be a strongly connected digraph. The average distance of a vertex $ v $ in $ D $ is defined as the arithmetic mean of the distances from $ v $ to all other vertic…

math.CO2025

On Proximity and other Distance Parameters in Planar Graphs

Peter Dankelmann, Sonwabile Mafunda, Sufiyan Mallu

Let $G$ be a 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 proximity and remotenes…

math.CO2025

Proximity and Radius in Outerplanar Graphs with Bounded Faces

Peter Dankelmann, Sonwabile Mafunda, Sufiyan Mallu

Let $G$ be a finite, connected graph and $v$ a vertex of $G$ . The average distance and the eccentricity of $v$ in $G$ are defined as the arithmetic mean and the maximum, respective…

math.CO2024

Remoteness of graphs with given size and connectivity constraints

Peter Dankelmann, Sonwabile Mafunda, Sufiyan Mallu

Let $G$ be a finite, simple 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 remotene…

math.CO2022★ 2 cited

Proximity, remoteness and maximum degree in graphs

Peter Dankelmann, Sonwabile Mafunda, Sufiyan Mallu

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…