On the graph of partial orders
DOI:
https://doi.org/10.31185/eduj.Vol2.Iss25.2746الكلمات المفتاحية:
Onالملخص
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.التنزيلات
المراجع
Ore O. Theory of graphs, Providence. Amer. Math.Soc. Colloq. Publ. 1962, Vol.18,270p.
Harary F. Palmmer E. Graphical enumeration, New York-London: Aca-demic press , 1973, 272p.
Rodionov V.I. A relation in finite topologies, Journal of soviet mathemat-ics 1984, Vol.24,pp. 458-460.
Erne M. On the cardinalities of finite topologies and the number of anti-chins in partially ordered sets. Discrete mathematics 1981, Vol.35, pp.119-133.
التنزيلات
منشور
إصدار
القسم
الرخصة
الحقوق الفكرية (c) 2021 Journal of Education College Wasit University

هذا العمل مرخص بموجب Creative Commons Attribution 4.0 International License.
