Eigenvalues of Antiadjacency Matrix of Directed Cyclic Dumbbell Graph

S. Budiyanto, S. Utama, S. Aminah

Research output: Contribution to journalConference articlepeer-review

2 Citations (Scopus)


This paper explains the steps used to find the characteristic polynomial of the antiadjacency matrix of a cyclic dumbbell graph. The antiadjacency matrix of a graph is a matrix whose entries represent whether there is an edge that connects two vertices or not. The general form of the characteristic polynomial includes its eigenvalues. The antiadjacency matrix is obtained by using some theorems, the number of solutions of integer equations, quadratic formula, and polynomials factorization. Finally, results showed that the coefficients of the characteristic polynomial and its eigenvalues were dependent on the number of vertices of the cyclic dumbbell graph.

Original languageEnglish
Article number012015
JournalJournal of Physics: Conference Series
Issue number1
Publication statusPublished - 4 Dec 2018
Externally publishedYes
Event2nd Mathematics, Informatics, Science and Education International Conference, MISEIC 2018 - Surabaya, Indonesia
Duration: 21 Jul 2018 → …


Dive into the research topics of 'Eigenvalues of Antiadjacency Matrix of Directed Cyclic Dumbbell Graph'. Together they form a unique fingerprint.

Cite this