Transitive reduction of a nilpotent Boolean matrix

DOI10.1016/0166-218X(84)90078-7zbMath0549.05043MaRDI QIDQ800374

Hiroshi Hashimoto

Publication date: 1984

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

adjacency matrixBoolean matrixacyclic digraphtransitive reduction

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Lattices (06B99)

Related Items (1)

On reduction of transitive fuzzy matrices and its applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Similarity relations and fuzzy orderings
• Applications of Graphs and Boolean Matrices to Computer Programming
• An Algorithm for Finding a Minimal Equivalent Graph of a Digraph
• An Efficient Algorithm for Constructing Hierarchical Graphs
• Boolean Matrix Method for the Construction of Hierarchical Graphs
• On the Boolean Matrix Equation M ^′ =ν _i=1 M ⁱ
• Computer construction of project networks
• An Algorithm for Finding a Minimum Equivalent Graph of a Digraph
• The Transitive Reduction of a Directed Graph
• A Theorem on Boolean Matrices
• Boolean Matrices and Logic
• Matrix development of the calculus of relations

This page was built for publication: Transitive reduction of a nilpotent Boolean matrix