Abstract
We established the concept of a binary reflexive relation of adjacency and determined the algebraic system consisting of all binary relations of set X and all unordered pairs of binary relations in terms of characteristic functions on the set of all binary relations of the set X. We investigated some properties of algebraic system of the structure of acyclic digraph. Also, we prove that if σ and τ are adjacent relations, then σ is acyclic relation (finite acyclic digraph) if and only if τ is an acyclic relation. Finally, the number of connected components of an acyclic relations graph is given an exact formula.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
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.
