DPChallenge: A Digital Photography Contest You are not logged in. (log in or register) 
 

DPChallenge Forums >> General Discussion >> Last wins
Pages:   ... [428] [429] [430] [431] [432] [433] [434] [435] [436] ... [1227]
Showing posts 10776 - 10800 of 30665, (reverse)
AuthorThread
 12/20/2011 10:19:43 PM · #10776
Oh your lucky you can't hear me right now.
 12/20/2011 10:20:57 PM · #10777
Oh, I can hear you alright.
 12/20/2011 10:23:04 PM · #10778
Oh, well in that case I better turn it down.
 12/20/2011 10:25:37 PM · #10779
Originally posted by IAmEliKatz:
GAHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHh

I just needed to get that out.

k thanks


hey can I join

GAHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH

ok I do feel better
 12/20/2011 10:26:47 PM · #10780
Keep it down... The kids are sleeping!
 12/20/2011 10:27:58 PM · #10781
Not anymore ;)
 12/20/2011 10:32:13 PM · #10782
You go take care of the crying kids... I'll be off playing video games while you suffer with the noise.
 12/20/2011 10:51:35 PM · #10783
lets turn the stereo up.....lets get the kids up
 12/20/2011 11:18:17 PM · #10784
I need a canvas and some paint. Quick!
 12/21/2011 09:35:20 AM · #10785
OK Picasso.
 12/21/2011 10:13:52 AM · #10786
Far From Picasso, Close to Crazy.
 12/21/2011 10:35:15 AM · #10787
Okay, who broke line lengths?
 12/21/2011 11:19:42 AM · #10788
morning...(barely)....everyone ready for Christmas???
 12/21/2011 12:13:15 PM · #10789
Originally posted by JH:
Okay, who broke line lengths?


Cowboy
 12/21/2011 12:14:43 PM · #10790
Originally posted by Ja-9:
morning...(barely)....everyone ready for Christmas???


We celebrate Christmahannukwanzikah around here...don't want people feeling left out.
 12/21/2011 03:00:15 PM · #10791
Originally posted by Spork99:
Originally posted by JH:
Okay, who broke line lengths?


Cowboy


Your welcome....Your lucky that I didn't break wind
 12/21/2011 03:04:01 PM · #10792
You're* :).
 12/21/2011 03:07:36 PM · #10793
Originally posted by cowboy221977:
Originally posted by Spork99:
Originally posted by JH:
Okay, who broke line lengths?


Cowboy


Your welcome....Your lucky that I didn't break wind


Broccoli stir fry...breaking wind and clearing rooms...it's what I do.
 12/21/2011 03:10:11 PM · #10794
Originally posted by HawkinsT:
You're* :).


sorry I was typing fast and didn't proofread
 12/21/2011 03:14:33 PM · #10795
For some graph G, we denote deg(v) as the degree of a vertex v of G. The degree of a vertex indicates the number of edges incident with that vertex. We go on to define d(G) = min {deg(v) | v in G} and D(G) = max {deg(v) | v in G}. d(G), then, is the least degree value of any of the vertices of G, D(G) the greatest.

We show that every tree T has at least D(T) leaves. Let n = D(T), and let r be a vertex of T with degree n. Then r is incident with n vertices of T which we'll call v1, v2, ..., vn. For each vi, we construct an arbitrary path Pi starting with r and ending with a leaf node wi. In symbols, Pi = r, vi, ..., wi. Each wi must be unique, for if Pi = ri, vi, ..., wi and Pj = rj, vj, ..., wj with wi = wj then we could join the two paths at r and its common leaf node to create a cycle in T thus arriving at a contradiction (a tree can have no cycles).
12/21/2011 03:17:29 PM · #10796
Originally posted by bvy:
For some graph G, we denote deg(v) as the degree of a vertex v of G. The degree of a vertex indicates the number of edges incident with that vertex. We go on to define d(G) = min {deg(v) | v in G} and D(G) = max {deg(v) | v in G}. d(G), then, is the least degree value of any of the vertices of G, D(G) the greatest.

We show that every tree T has at least D(T) leaves. Let n = D(T), and let r be a vertex of T with degree n. Then r is incident with n vertices of T which we'll call v1, v2, ..., vn. For each vi, we construct an arbitrary path Pi starting with r and ending with a leaf node wi. In symbols, Pi = r, vi, ..., wi. Each wi must be unique, for if Pi = ri, vi, ..., wi and Pj = rj, vj, ..., wj with wi = wj then we could join the two paths at r and its common leaf node to create a cycle in T thus arriving at a contradiction (a tree can have no cycles).


That's just what I was thinking.
 12/21/2011 03:19:15 PM · #10797
E=M C 2
 12/21/2011 03:19:54 PM · #10798
Shenanigans
 12/21/2011 03:21:13 PM · #10799
Originally posted by IAmEliKatz:
Shenanigans


Yeah that too
 12/21/2011 03:31:32 PM · #10800
Damn - I just thought about THE GAME...
Pages:   ... [428] [429] [430] [431] [432] [433] [434] [435] [436] ... [1227]
Current Server Time: 08/08/2025 08:46:17 AM

Please log in or register to post to the forums.


Home - Challenges - Community - League - Photos - Cameras - Lenses - Learn - Help - Terms of Use - Privacy - Top ^
DPChallenge, and website content and design, Copyright © 2001-2025 Challenging Technologies, LLC.
All digital photo copyrights belong to the photographers and may not be used without permission.
Current Server Time: 08/08/2025 08:46:17 AM EDT.