z-logo
open-access-imgOpen Access
On the graph of partial orders
Author(s) -
Khalid Shea Khairalla Aljabri
Publication year - 2021
Publication title -
maǧallaẗ kulliyyaẗ al-tarbiyaẗ
Language(s) - English
Resource type - Journals
eISSN - 2518-5586
pISSN - 1994-4217
DOI - 10.31185/eduj.vol2.iss25.2746
Subject(s) - binary relation , mathematics , binary number , adjacency list , graph , discrete mathematics , algebraic number , combinatorics , adjacency matrix , set (abstract data type) , computer science , arithmetic , mathematical analysis , programming language
Any binary relation (where is an arbitrary set) generates a charac-teristic function on the set : If , then , otherwise . In terms of characteristic functions on the set of all binary rela-tions of the set we introduced the concept of a binary of reflexive relation of adjacency and determined the algebraic system consisting of all binary re-lations of a set and all unordered pairs of various adjacent binary rela-tions. If is finite set then this algebraic system is a graph “ a graph of graphs” in this work we investigated some features of the structures of the graph of partial orders.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here