answersLogoWhite

0

a graph that contains at least one null vertex is called forest

answer from :abdul rasheed rind: "the collection of trees is called forest"

SS:A forest is an undirected graph, all of whose connected components are trees; in other words, the graph consists of a disjoint union of trees.

User Avatar

Wiki User

14y ago

Still curious? Ask our experts.

Chat with our AI personalities

LaoLao
The path is yours to walk; I am only here to hold up a mirror.
Chat with Lao
BlakeBlake
As your older brother, I've been where you are—maybe not exactly, but close enough.
Chat with Blake
RossRoss
Every question is just a happy little opportunity.
Chat with Ross

Add your answer:

Earn +20 pts
Q: What is forest in graph theory?
Write your answer...
Submit
Still have questions?
magnify glass
imp