Graph Theory: 46. Relation Between Minimun Degree and Subtrees - TopicsExpress



          

Graph Theory: 46. Relation Between Minimun Degree and Subtrees ift.tt/1tVHnbZ It is not surprising that a tree of order k is a subgraph of a complete graph of order at least k. Here Ill explain the result that shows for every tree T of order k, any graph with minimum degree at least k-1 will contain a subgraph isomorphic to T. The proof is by induction on the order of the tree. -- Bits of Graph Theory by Dr. Sarada Herke. Related videos: For quick videos about Math tips and useful facts, check out my other channel Spoonful of Maths - ift.tt/1pPHbdg --- Links --- Website - saradaherke Facebook - ift.tt/12KK2iZ Twitter - ift.tt/1yDiaaI Twitter - ift.tt/12KK0Ys Google Plus - ift.tt/1s1kBiX
Posted on: Fri, 05 Dec 2014 02:51:45 +0000

Trending Topics



Recently Viewed Topics




© 2015