Some Cobweb Posets Digraphs' Elementary Properties and Questions

Abstract

A digraph that represents reasonably a scheduling problem should be a directed acyclic graph. Here down we shall deal with special kind of graded $DAGs$ named $KoDAGs$. For their definition and first primary properties see $[1]$, where natural join of directed biparted graphs and their corresponding adjacency matrices is defined and then applied to investigate cobweb posets and their $Hasse$ digraphs called $KoDAGs$. In this report we extend the notion of cobweb poset while delivering some elementary consequences of the description and observations established in $[1]$.

6 pages, 2 figures,affiliated to The Internet Gian-Carlo Polish Seminar: http://ii.uwb.edu.pl/akk/sem/sem_rota.htm

Cited by in corpus (9)

• Cobweb posets - Recent Results
• On cobweb posets most relevant codings
• Graded posets zeta matrix formula
• How the work of Gian Carlo Rota had influenced my group research and life
• Graded posets inverse zeta matrix formula
• On natural join of posets properties and first applications
• Natural join construction of graded posets versus ordinal sum and discrete hyper boxes
• Note on Ward-Horadam H(x) - binomials' recurrences and related interpretations, II
• New formulas for Stirling-like numbers and Dobinski-like formulas