Abstract :

In this paper, we introduce a new method using the adjacency matrix and characteristic polynomial of a graph to determine the covering number of graphs. New tangible relations between the structure properties of simple graphs and characteristic polynomials have been constructed.