Mafunda's research is in mathematics, with focus on graph theory - particularly on distances in graphs and digraphs, some aspects of algebraic graph theory, with a special interest in graph automorphisms, and certain aspects of cryptography.
Thesis and Dissertations:
| Title | Authors | University | Link |
|---|---|---|---|
| PhD Dissertation: Aspects of Distance Measures in Graphs and Digraphs | Dankelmann P.; Jonck E.; Mafunda S. | University of Johannesburg, South Africa | Click Here |
| MSc Thesis: Algebraic Graph Theoretic Applications To Cryptography | Amery G.; Mafunda S.; Mukwembi S.; Swart C. | University of KwaZulu-Natal, South Africa | Click Here |
Publications:
| Year | Authors | Title | Publication Details |
|---|---|---|---|
| 2024 + | Dankelmann, P.; Mafunda, S.; Mallu, S. | Remoteness of graphs with given size and connectivity constraints | Click Here |
| 2024 + | Mafunda, S.; Merzel, J. L.; Perry, K. E.; Varvak, A | Paint cost spectrum of perfect k-ary trees | Click Here |
| 2023 | DeVilbiss, M.; Fain, B.; Holmes, A.; Horn, P.; Mafunda, S.; Perry, K. E. | An Extremal Problem on Rainbow Spanning Trees in Graphs - Australasian Journal of Combinatorics 86 |
Click Here |
| 2022 | Dankelmann, P.; Mafunda, S.; Mallu, S. | Proximity, remoteness, and maximum degree in graphs - Discrete Mathematics and Theoretical Computer Science 24 |
Click Here |
| 2022 | Dankelmann, P.; Mafunda, S. | On the difference between proximity and other distance parameters in triangle-free and C4 graphs - Discrete Applied Mathematics 321 |
Click Here |
| 2021 | Ai, J.; Gerke, S.; Gutin, G.; Mafunda, S. | Proximity and Remoteness in Directed and Undirected Graphs - Discrete Mathematics 344 |
Click Here |
| 2021 | Dankelmann, P.; Jonck, E.; Mafunda, S. | Proximity and remoteness in triangle-free and C4 -free graphs in terms of order and minimum degree - Discrete Mathematics 344 |
Click Here |