Unformatted text preview: k contains at least k leaves. (6) For two points in R 2 , P 1 = ( x 1 ,y 1 ) and P 2 = ( x 2 ,y 2 ), let d : R 2 × R 2 → R be given by d ( P 1 ,P 2 ) =  x 2x 1  +  y 2y 1  . Show that d is a metric on R 2 . (7) For all n ∈ N what is the eccentricity of each vertex of K n ? How many centers does K n have? (8) Draw all spanning trees of the graph G . • < < < < < < < < < < ± ± ± ± ± ± ± ± ± ± G : • • • ± ± ± ± ± ± ± ± ± ± < < < < < < < < < < • • • • ? ? ? ? ? ? ? ? ?...
View
Full Document
 Spring '11
 ADEBOYE
 Graph Theory, Vertex, complete graph Kn, tripartite graph Kr,s,t

Click to edit the document details