2004Shuxue de shijian yu renshiRequires access

On Transitivity and Transitive Closure for Binary Relation

Chen Xian-qiang

Open publisher page 0 citations

Abstract

We deal with transitivity and transitive closure for binary relation. We put forward the concept of middle point, obtain invariance of transitivity under power product of binary relation and simplify the algorithm in computing transitive closure.

About this research paper

What this paper is about

We deal with transitivity and transitive closure for binary relation. We put forward the concept of middle point, obtain invariance of transitivity under power product of binary relation and simplify the algorithm in computing transitive closure.

Why it matters

A significance statement is not available in the OpenAlex record.

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

We deal with transitivity and transitive closure for binary relation. We put forward the concept of middle point, obtain invariance of transitivity under power product of binary relation and simplify the algorithm in computing transitive closure.

Key concepts: Transitive closure, Transitive relation, Transitive reduction, Binary relation, Preorder, Mathematics, Closure (psychology), Relation (database)

Related papers

Back to paper searchBrowse research topicsOriginal source
On Transitivity and Transitive Closure for Binary Relation — Research Paper | ScholarLens