A computer program on some operations on simple graphs using Turbo Pascal 5.5

Date of Publication

1996

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Abstract/Summary

The study aims to formulate algorithms in performing some operations on simple graphs. A graph is said to be a simple graph if it has no loops nor multiple edges. Some of the operations are defined for a single graph but the others require the use of two graphs. The operations covered in this study are: deletion of a vertex set, deletion of an edge set, addition of an edge set and complement of a graph, including union and intersection of two graphs. Operations are performed by the manipulation of the adjacency matrix of the given graphs. Thus, a new adjacency matrix is formed.This study provides definitions of the operations in terms of the resulting vertex set and edge set of the given graphs necessary for the construction of the algorithms. It also gives examples for each definition and illustrations for each algorithm.

Abstract Format

html

Language

English

Format

Print

Accession Number

TU07437

Shelf Location

Archives, The Learning Commons, 12F Henry Sy Sr. Hall

Physical Description

122 leaves

Keywords

Graph theory; Programming (Mathematics); Computer programs; Pascal (Computer program language)

This document is currently not available here.

Share

COinS