Proof in graph theory: maximum degree and number of leaves. – math.stackexchange.com

Proof in graph theory: maximum degree and number of leaves. – math.stackexchange.com

02:27 No Comments
I have to prove that if $v$ is a vertex of maximum degree in a tree and the degree of $v$ is $k$, then the tree has at least $k$ vertices of degree $1$. I think I get why that is true: If $v$ has $k$ ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Unknown

Artikel Terkait

0 Comment to "Proof in graph theory: maximum degree and number of leaves. – math.stackexchange.com"

Post a Comment

Subscribe to: Post Comments (Atom)