The Relation Between Topological Ordering and Adjacency Matrix in Digraphs
T Rastad, N Delfan
Abstract
T Rastad, N Delfan
Abstract
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, rst the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of adjacency matrix in acyclic digraphs are presented.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, rst the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of adjacency matrix in acyclic digraphs are presented.
Key concepts: Adjacency matrix, Adjacency list, Node (physics), Combinatorics, Topology (electrical circuits), Mathematics, Matrix (chemical analysis), Graph energy