SPECTRAL ASPECTS OF AVERAGE VERTEX CONNECTIVITY OF A GRAPH

Simple item page
dc.date.accessioned2025-02-06T07:45:16Z
dc.date.accessioned2025-12-22T11:55:19Z
dc.date.available2025-02-06T07:45:16Z
dc.date.created2025-02-06T07:45:16Z
dc.date.issued2021-08-01
dc.description.abstractThe measures of global connectivity such as graph integrity and toughness have non-polynomial time complexities. This has led to the development of global average graph vertex connectivity measures that are dependent on combinatoric counting of number of internally disjoint paths in a graph. Many results related to average vertex connectivity have been found. This study develops a spectral form of average vertex connectivity, together with its upper bounds. Using trees, we demonstrate that the new definition and its upper bounds are more related to ordinary graph parameters.
dc.identifierMalota, Ridson
dc.identifierSchool of Natural and Applied Sciences
dc.identifierhttps://dspace.unima.ac.mw/handle/123456789/768
dc.identifier.urihttps://edurepo.maren.ac.mw/handle/123456789/1954
dc.languageen
dc.subjectGraph
dc.subjectVertex connectivity
dc.subjectNon- polynomial
dc.titleSPECTRAL ASPECTS OF AVERAGE VERTEX CONNECTIVITY OF A GRAPH
dc.typetext::thesis::master thesis

Files

Collections

Theses