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

L. Widiastuti, S. Utama, S. Aminah

Research output: Contribution to journalConference article

1 Citation (Scopus)

Abstract

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 →Wn is denoted by (→Wn ). From the matrix (→Wn ) the general form of the characteristic polynomial and the eigenvalues of a directed cyclic wheel graph →Wn 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 →Wn . It turns out that each coefficient = 1, 2, (2), equals zero except 1 is equal to -1. In addition the matrix →Wn ) 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 →Wn or (→Wn ) has a relation with the complex eigenvalues of the antiadjacency matrix of a directed cyclic wheel graph →Wn or (→Wn ), that is the complex eigenvalues of the matrix (→Wn ) are equal to the negative of the complex eigenvalues of the matrix (→Wn ).

Original languageEnglish
Article number012002
JournalJournal of Physics: Conference Series
Volume1211
Issue number1
DOIs
Publication statusPublished - 7 May 2019
Event2nd International Conference of Combinatorics, Graph Theory, and Network Topology, ICCGANT 2018 - Jember, East Java, Indonesia
Duration: 24 Nov 201825 Nov 2018

Fingerprint Dive into the research topics of 'The adjacency matrix of directed cyclic wheel graph (→W<sub>n</sub>)'. Together they form a unique fingerprint.

  • Cite this