Math Is Fun Forum
Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ π -¹ ² ³ °
You are not logged in.
- Topics: Active | Unanswered
#1 2010-08-12 10:22:46
- samuel12
- Member
- Registered: 2010-07-17
- Posts: 19
Discrete
Hi guys just some quick questions (need answered asap please 
)
(i) Prove that in any digraph with p vertices
p-1 >= RC(u) >= 1-p Where RC(u) = outreach(u) - inreach(u) and u is some vertex.
(ii) Prove that in any acyclic digraph, if (u,v) is an arc then RC(u)>RC(v)
(iii) Prove that if u is any source in an acyclic digraph and v is a sink, then
RC(u)>=RC(v)
under what circumstances can equality occur.
Thanks guys=)
Offline
#2 2010-08-16 12:26:10
- dheejay
- Member
- Registered: 2010-08-16
- Posts: 1
Offline
#3 2010-08-16 12:52:19
- bobbym
- bumpkin
- From: Bumpkinland
- Registered: 2009-04-12
- Posts: 109,606
Re: Discrete
Hi dheejay;
Welcome to the forum!
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline