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.
Chat with our AI personalities
defines in graph theory defines in graph theory
No its not. A cycle is closed trail
strong domination, mixed domination,domination cliques
the five graph is line graph,bar graph,pictograph,pie graph and coin graph
bar graph,line graph and pie graph