@inproceedings{1ebe1d7144e4406cb33d13bc25cfa420,

title = "Properties of adjacency matrix of the directed cyclic friendship graph",

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.",

author = "Nanda Aiizana and Siti Aminah and Suarsih Utama",

note = "Publisher Copyright: {\textcopyright} 2021 American Institute of Physics Inc.. All rights reserved.; International Conference on Mathematics, Computational Sciences and Statistics 2020, ICoMCoS 2020 ; Conference date: 29-09-2020",

year = "2021",

month = feb,

day = "26",

doi = "10.1063/5.0042158",

language = "English",

series = "AIP Conference Proceedings",

publisher = "American Institute of Physics Inc.",

editor = "Cicik Alfiniyah and Fatmawati and Windarto",

booktitle = "International Conference on Mathematics, Computational Sciences and Statistics 2020",

}