Properties of adjacency matrix of the directed cyclic friendship graph

Nanda Aiizana, Siti Aminah, Suarsih Utama

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Abundance of information about the structure of a graph can be derived from the eigenvalues of its matrix representation. The eigenvalues are always connected to the characteristic polynomial of the matrix representation of a graph. In this paper, we discuss about the properties of adjacency matrix of the directed cyclic friendship graph, its cycle part is clockwise-oriented. By adding the values of the determinan s of all directed cyclic induced subgraphs, the coefficients of the characteristic polynomial of the adjacency matrix of the directed cyclic friendship graph can be obtained. The real eigenvalues are obtained by factorization method, while the complex eigenvalues are obtained by root of complex number formula.

Original languageEnglish
Title of host publicationInternational Conference on Mathematics, Computational Sciences and Statistics 2020
EditorsCicik Alfiniyah, Fatmawati, Windarto
PublisherAmerican Institute of Physics Inc.
ISBN (Electronic)9780735440739
DOIs
Publication statusPublished - 26 Feb 2021
EventInternational Conference on Mathematics, Computational Sciences and Statistics 2020, ICoMCoS 2020 - Surabaya, Indonesia
Duration: 29 Sep 2020 → …

Publication series

NameAIP Conference Proceedings
Volume2329
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616

Conference

ConferenceInternational Conference on Mathematics, Computational Sciences and Statistics 2020, ICoMCoS 2020
Country/TerritoryIndonesia
CitySurabaya
Period29/09/20 → …

Fingerprint

Dive into the research topics of 'Properties of adjacency matrix of the directed cyclic friendship graph'. Together they form a unique fingerprint.

Cite this