Computer Science, asked by KarmaAkabane4703, 3 months ago

A connected graph T without any cycles is called ________________.

Answers

Answered by kanishkabasetia39
2

Answer:

A connected graph T without any cycles is called a tree graph.

hope it is helpful....mark me as brainlist

Answered by rahul123437
0

A connected graph T without any cycles is called Tree.

Explanation:

  • A connected graph T without any cycles is called  Tree
  • A graph is said to be complete if there is an edge between every pair of vertices.
  • If a connected graph has no cycles then it is a connected acyclic graph known as a tree.
Similar questions