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

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