Multiple choice technology architecture

A connected graph T without any cycles is called

  1. a tree graph

  2. free tree

  3. a tree

  4. All of above
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

A connected acyclic graph is the fundamental definition of a tree in graph theory. Such graphs are called trees, free trees (to distinguish from rooted trees), or tree graphs interchangeably. All terms refer to the same structure - minimally connected, maximally acyclic.

Keep practicing — related questions