Mario Lamas Espinoza

 Mathematics

Associated with Math.SE; for both general discussion & math qu...
May 17, 2016 00:55
I have this definition
La clouse of a weigthed digraph $D$ is the vertex set $C$ of $D$ such that if $x \in C$ and $(x,y) \in$ arcs of D then $y \in C$
May 17, 2016 00:52
The statement is in the page 5
May 17, 2016 00:42
I don't understand this statement: "Consider a weighted digraph $D$. Let $D’$ be a spanning subdigraph of $D$ (i.e. $D’$
is obtained from D by removing some of the arcs). Let $C$ and $C’$ be maximum
closures of D and D’, respectively. Then
$ w(C) \leq w(C') $."
May 17, 2016 00:38
Hi