A directed unicyclic graph is a directed graph that has only one directed cycle subgraph. A directed unicyclic helm graph H-n is obtained from a directed wheel graph W-n by adjoining a directed pendant edge at each vertex of the cycle. A directed graph can be represented into several matrix representations, one of them is the antiadjacency matrix. The antiadjacency matrix is a matrix in which the entries represent whether there is a directed edge from one vertex to another. This paper discusses the general form of the coefficients of the characteristic polynomial that obtained by adding all of the determinants of antiadjacency matrix from each induced acyclic and cyclic subgraphs. The eigenvalues of the antiadjacency matrix of the directed unicyclic helm graph obtained by polynomial factorization. The result obtained denotes that the coefficients of the characteristic polynomial and eigenvalues of the antiadjacency matrix depend on the number of vertices of the cycle subgraphs of directed unicyclic helm graph.
|Journal of Physics: Conference Series
|Published - 7 Jan 2021
|10th International Conference and Workshop on High Dimensional Data Analysis, ICW-HDDA 2020 - Sanur-Bali, Indonesia
Duration: 12 Oct 2020 → 15 Oct 2020