Computer Science, asked by rmadhe2006, 4 months ago

graph G is called a ..... if it is a connected acyclic graph​

Attachments:

Answers

Answered by akku111201
0

Answer:

p is false and q is true....this is the correct answer for this question

Similar questions