Questions LLC
Login
or
Sign Up
Ask a New Question
Connected Graphs
Questions (1)
let g = (v, e) be a connected graph in which every vertex is a leaf. prove that g has exactly one edge
TYUqnn3832
2 answers
asked anonymously
55 views
Parent Categories (1)
Graph Theory
