Extremal caterpillar-like trees relative to the Wiener index
| dc.contributor.advisor | Andriantiana, Eric (https://orcid.org/0000-0003-2899-0483 ) | |
| dc.contributor.advisor | Shozi, Zekhaya Bernard (https://orcid.org/0000-0001-8938-0836) | |
| dc.contributor.author | Dingile, Ndimphiwe Bradley Morné | |
| dc.copyrightDate | 2026-02 | |
| dc.date.accessioned | 2026-06-04T10:22:47Z | |
| dc.date.issued | 2026-03-27 | |
| dc.description.abstract | The Wiener index of a graph \(G\) is the sum of the distances between all vertex pairs in \(G\). A caterpillar-like tree is a tree where all its branching vertices (vertices of degree at least 3) lie on the same path. This project focuses on the class of caterpillar-like trees with given order and other restrictions such as number of leaves and maximum degree. The aim is to determine the structures of those caterpillar-like trees that reach the minimum (and maximum) Wiener index under the prescribed restrictions. | |
| dc.description.degree | Master of Science | |
| dc.description.degreelevel | Master's | |
| dc.digitalOrigin | born digital | |
| dc.extent | 1 online resource (95 pages) | |
| dc.form | ||
| dc.form.media | Computer | |
| dc.identifier.uri | https://researchrepository.ru.ac.za/handle/20.500.14915/10191 | |
| dc.note.thesis | Thesis (MSc) -- Faculty of Science, Mathematics, 2026 | |
| dc.publisher | Rhodes University | |
| dc.rights | https://creativecommons.org/licenses/by-nc-sa/4.0/ | |
| dc.rights.holder | Dingile, Ndimphiwe Bradley Morné | |
| dc.subject.discipline | Mathematics | |
| dc.subject.lcsh | Graph theory (http://id.loc.gov/authorities/subjects/sh85056471) | |
| dc.subject.wikidata | Wiener index (https://www.wikidata.org/wiki/Q909065) | |
| dc.subject.wikidata | Caterpillar tree (https://www.wikidata.org/wiki/Q5051951) | |
| dc.title | Extremal caterpillar-like trees relative to the Wiener index | |
| dc.type | Academic Thesis | |
| dc.typeOfResource | text |