I'm not sure where to post this, but anyway here is the question:(adsbygoogle = window.adsbygoogle || []).push({});

Given a graph G(p,q) is a tree where p is the number of vertices and q is the number of edges.

Since given graph is a tree, number of edges q=p-1.

How do you prove that every non-trivial tree has atleast two vertices with degree less than 2?

P.S.: A tree is a connected acyclic graph.

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Question on Graph theory

Loading...

Similar Threads - Question Graph theory | Date |
---|---|

I Question about inverse operators differential operators | Feb 9, 2018 |

I Field Extensions - Lovett, Theorem 7.1.10 - Another question | May 7, 2017 |

Basic Graph Theory Question | Oct 23, 2014 |

**Physics Forums - The Fusion of Science and Community**