University of Technology-IraqEngineering and Technology Journal1681-690031420130328On Some Properties of Characteristics Polynomials of the Complete Graphs Kn5205288416210.30684/etj.31.4B.10ENNuha A. RajabSamaa F. IbraheemEman H. OudaJournal Article20130301This paper discusses the properties of the characteristic polynomial of the complete graphs Kn, n=1, 2… respective to the adjacency matrices. Two different types of matrices, the adjacency matrix and the signless Laplacian matrix, are presented. A recurrence relation for computing the characteristic polynomials depending on the adjacency matrix is introduced. We deduce that the coefficients of the polynomials based on the two different matrices have a relationship with Pascal triangle. The coefficients are computed using Matlab program. Many other properties of these coefficients are discussed also.https://etj.uotechnology.edu.iq/article_84162_a6587b0f6569e76d4d1046acd0462036.pdf