Sonwabile Mafunda

According to our database, Sonwabile Mafunda authored at least 8 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Proximity and radius in outerplanar graphs with bounded faces.

Peter Dankelmann, Sonwabile Mafunda, Sufiyan Mallu

Discret. Math., 2026

Paint cost spectrum of perfect k-ary trees.

Sonwabile Mafunda, Jonathan L. Merzel, Katherine Perry, Anna Varvak

Art Discret. Appl. Math., 2026

2025

Remoteness of graphs with given size and connectivity constraints.

Peter Dankelmann, Sonwabile Mafunda, Sufiyan Mallu

Discret. Math., 2025

2023

An extremal problem on rainbow spanning trees in graphs.

Matthew DeVilbiss, Bradley Fain, Amber Holmes, Paul Horn, Sonwabile Mafunda, K. E. Perry

Australas. J Comb., June, 2023

2022

Proximity, remoteness and maximum degree in graphs.

Peter Dankelmann, Sonwabile Mafunda, Sufiyan Mallu

Discret. Math. Theor. Comput. Sci., 2022

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

Peter Dankelmann, Sonwabile Mafunda

Discret. Appl. Math., 2022

2021

Proximity and remoteness in triangle-free and <i>C</i>₄-free graphs in terms of order and minimum degree.

Peter Dankelmann, Elizabeth Jonck, Sonwabile Mafunda

Discret. Math., 2021

Proximity and remoteness in directed and undirected graphs.

Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Sonwabile Mafunda

Discret. Math., 2021