In graph theory, a tree is a graph that is:Connected with no cyclesDisconnected with cyclesConnected with cyclesDisconnected with no cycles

Any graph is a tree if and only if the graph is.... Question 32Select one: A directed graph Completely connected Contains no cycles

A connected graph with no cycles is called:A. TreeB. ForestC. PathD. Bipartite graph

Which of the following is NOT a property of a tree in graph theory?A connected graph with n−1 edges where n is the number of vertices.There is exactly one path between any two vertices.A tree with n vertices has exactly n−1 edges.It may contain cycles.

Which of the following statements about trees in graph theory is true?AA tree can contain cyclesBA tree is always a disconnected graphCA tree with n vertices has n−1 edgesDA tree has at least one cycle

Which of the following is true?Every simple graph with 5 vertices and 4 edges is a tree.Every connected graph with 8 vertices and 9 edges is a tree.Every simple connected graph with 6 vertices and 7 edges is a tree.Every tree with 11 vertices is simple, connected and has 10 edges.unanswered