TUTTE POLYNOMIALS OF WHEEL-SUNFLOWER GRAPHS AND THEIR APPLICATIONS

Simple item page
dc.date.accessioned2024-12-10T07:55:48Z
dc.date.accessioned2025-12-22T11:55:45Z
dc.date.available2024-12-10T07:55:48Z
dc.date.created2024-12-10T07:55:48Z
dc.date.issued2004-01-01
dc.description.abstractWe define a graph and call it a wheel-sunflower graph considered as one of the compatibility graphs that may arise in computer-based network information systems. Then we study characterizations that permit us to compute Tutte polynomials of wheel sunflowers using Tutte polynomials of generalized parallel connections. As one of the applications of Tutte polynomials, we characterize wheel-sunflowers by numerical invariants and deduce their T-uniqueness - that is, graphs determined up to isomorphism by their Tutte polynomials. We also apply the theory of Tutte polynomials to determine the component numbers of links corresponding to Wheel-sunflower graphs and show how these numbers change by removing certain edges.
dc.identifierKamndaya, Mphatso Steve
dc.identifierSchool of Natural and Applied Sciences
dc.identifierhttps://dspace.unima.ac.mw/handle/123456789/437
dc.identifier.urihttps://edurepo.maren.ac.mw/handle/123456789/1973
dc.languageen
dc.subjecttutte polynomials
dc.subjectTutte polynomials
dc.subjectNetwork information systems
dc.subjectParallel connections
dc.subjectWheel sunflowers
dc.subjectT-uniqueness
dc.subjectNumerical invariants
dc.subjectIsomorphism
dc.titleTUTTE POLYNOMIALS OF WHEEL-SUNFLOWER GRAPHS AND THEIR APPLICATIONS
dc.typetext::thesis::master thesis

Files

Collections

Theses