The adjacency matrix of directed cyclic wheel graph (→W_n)

An adjacency matrix is one of the matrix representations of a directed graph. In this paper, the adjacency matrix of a directed cyclic wheel graph →W_n is denoted by (→W_n ). From the matrix (→W_n ) the general form of the characteristic polynomial and the eigenvalues of a directed cyclic wheel graph →W_n can be obtained. The norm of each coefficient of its characteristic polynomial is obtained by calculating the sum of the principal minors of subgraphs of the graph →W_n . It turns out that each coefficient = 1, 2, (2), equals zero except 1 is equal to -1. In addition the matrix →W_n ) has real eigenvalues and also some complex eigenvalues that conjugate each other. The real eigenvalues are obtained by searching the real roots through the characteristic equation, then by factorization we get the polynomial factor that contains the complex roots. The complex eigenvalues of the adjacency matrix of a directed cyclic wheel graph →W_n or (→W_n ) has a relation with the complex eigenvalues of the antiadjacency matrix of a directed cyclic wheel graph →W_n or (→W_n ), that is the complex eigenvalues of the matrix (→W_n ) are equal to the negative of the complex eigenvalues of the matrix (→W_n ).