Math, asked by farihanoor444, 8 months ago

prove that every tree is a bipartite graph?​

Answers

Answered by tanyagautam144
3

Step-by-step explanation:

There is a unique path between any 2 vertices in a tree. Every tree with at least 2 vertices has at least 2 vertices of degree 1. Every tree is bipartite. Removing any edge from a tree will separate the tree into 2 connected components.

Similar questions