Some inequalities for orderings of acyclic digraphs

Details Some inequalities for orderings of acyclic digraphs Some inequalities for orderings of acyclic digraphs

2011-10-14

arxiv.org/abs/1110.3107v1

Mathematics

Combinatorics

Scientific paper

For any acyclic ordering $g$ of a finite acyclic digraph $D$ we obtain a lower bound inequality for the inner product of its $e-$vector and $g.$ Here the $e-$vector is defined to be the difference of the indegree and the outdegree of the underlying acyclic digraph. This gives a lower bound on the functional $ T_e(f) = ,$ defined on the set of all acyclic orderings of $D.$ The class of acyclic digraphs which admit an acyclic ordering attaining the lower bound is determined as the class of posets of order dimension two.

Affiliated with

Also associated with

No associations

Rating

Some inequalities for orderings of acyclic digraphs 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 inequalities for orderings of acyclic digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some inequalities for orderings of acyclic digraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-521935