Alex Alochukwu

most citedUpper Bounds on the average eccentricity of Graphs of Girth

6

and

(C_{4}

C_{5})

-free Graphs

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

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2025

A note on the $k$ -defect number: Vertex Coloring with a Fixed Number of Monochromatic Edges

Eunice Mphako-Banda, Christo Kriel, Alex Alochukwu

In this paper, we introduce and study a novel graph parameter called the $k$ -defect number, denoted $ϕ_{k} (G)$ , for a graph $G$ and an integer $0 \leq k \leq ∣ E (G) ∣$ . Unlike traditio…

math.CO2020

Wiener index in graphs with given minimum degree and maximum degree

Peter Dankelmann, Alex Alochukwu

Let $G$ be a connected graph of order $n$ .The Wiener index $W (G)$ of $G$ is the sum of the distances between all unordered pairs of vertices of $G$ . In this paper we show that the…

math.CO2020★ 2 cited

Upper Bounds on the average eccentricity of Graphs of Girth $6$ and $(C_{4}$ , $C_{5})$ -free Graphs

Alex Alochukwu, Peter Dankelmann

Let $G$ be a finite, connected graph. The eccentricity of a vertex $v$ of $G$ is the distance from $v$ to a vertex farthest from $v$ . The average eccentricity of $G$ is the arithme…

A note on the k-defect number: Vertex Coloring with a Fixed Number of Monochromatic Edges

Wiener index in graphs with given minimum degree and maximum degree

Upper Bounds on the average eccentricity of Graphs of Girth 6 and (C4​, C5​)-free Graphs

A note on the $k$ -defect number: Vertex Coloring with a Fixed Number of Monochromatic Edges

Upper Bounds on the average eccentricity of Graphs of Girth $6$ and $(C_{4}$ , $C_{5})$ -free Graphs