Complex adjacency spectra of digraphs
| dc.contributor.author | Sahoo G. | en_US |
| dc.date.accessioned | 2025-02-17T09:57:03Z | |
| dc.date.issued | 2021 | |
| dc.description.abstract | In this article, we consider only those (simple) digraphs which satisfy the property that if (Formula presented.) is an edge of a digraph, then (Formula presented.) is not an edge of it. A new matrix representation of a digraph is considered and the matrix is named as the complex adjacency matrix. The eigenvalues and the eigenvectors of the complex adjacency matrices of cycle digraphs and directed trees are obtained and it is shown that not only the eigenvalues of these matrices but also the eigenvectors provide a lot of information about the structure of these digraphs. � 2019 Informa UK Limited, trading as Taylor & Francis Group. | en_US |
| dc.identifier.citation | 3 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1080/03081087.2019.1591337 | |
| dc.identifier.uri | https://idr.iitbbs.ac.in/handle/2008/3669 | |
| dc.language.iso | en | en_US |
| dc.subject | B. Shader; complex adjacency matrix; complex adjacency spectrum; cospectral co-base digraphs; counter spectral co-base digraphs; Digraphs | en_US |
| dc.title | Complex adjacency spectra of digraphs | en_US |
| dc.type | Article | en_US |