Abstract
Adjacency and antiadjacency matrices are the representation matrices of a directed graph. From the earlier papers, its have been known that the powering of the adjacency matrix of a directed graph can be used to find the number of directed paths and cycles. However, we found that there is a case in which the theorem does not work. Therefore, in this paper, we will extend the powering of the adjacency matrix of a directed graph and also give the additional requirement so that the properties are worked. We also generalized the case for a general directed graph, which means the graph might have loop(s) and digon(s). On the other hand, we also give the representation of the powering of the antiadjacency matrix.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.