Some Cobweb Posets Digraphs' Elementary Properties and Questions

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Scientific paper

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]$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Some Cobweb Posets Digraphs' Elementary Properties and Questions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some Cobweb Posets Digraphs' Elementary Properties and Questions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some Cobweb Posets Digraphs' Elementary Properties and Questions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-605268

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.