A Study of Graph Theory With Matrix Representation

Abstract

In this thesis, we study the main well known results in graph theory. In particular, we study many formulation and properties of finite simple graphs through their matrix representation such as incidence and adjacency matrix, etc. In addition, we compute the spectral of adjacency, Laplacian, and antiadjecency matrices of some special graphs. Furthermore, we compare the largest eigenvalue of antiadjecency matrices that is constructed by some Boolean operations.