2012•International journal of mathematical modelling and computationsOpen access

The Relation Between Topological Ordering and Adjacency Matrix in Digraphs

T Rastad, N Delfan

Open full text 1 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Adjacency matrix, Adjacency list, Node (physics), Combinatorics, Topology (electrical circuits), Mathematics, Matrix (chemical analysis), Graph energy

Related papers

Back to paper searchBrowse research topicsOriginal source
The Relation Between Topological Ordering and Adjacency Matrix in Digraphs — Research Paper | ScholarLens