COVERING AND INDEPENDENT NUMBERS

ABSTRACT
COVERING AND INDEPENDENCE NUMBERS OF GRAPHS
Ahmad Mansour Al- Hawarat
Mu'tah University, 2009

In this thesis ,we will discuss the basic concepts of simple graphs and the related characteristic polynomials of the adjacency matrices for the well known graphs ,also we will investigate the basic concepts of covering and independence numbers of graphs and the related characteristic polynomials of graphs which introduce some new and tangible results.

New programs constructed in this thesis to sketch the graphs from the adjacency matrices ,the complements of the graphs ,the line graphs ,the covering numbers of vertices ,the independence number of vertices ,the characteristic polynomials ,the detriments of the adjacency matrices of graphs ,the eigen values of graphs ,the number of walks in graphs, and the spectrum of graphs which programmed in mathematica program.

And all this makes the covering and independence number of graphs, and all properties of the graphs more easier and tangible .