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

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

A graph that is both bipartite and complete is:A. PlanarB. TreeC. CycleD. Complete bipartite graph

If a graph has 𝑛n vertices and no edges, it is called:A. Null graphB. Regular graphC. Complete graphD. Bipartite graph

A bipartite graph always contain cycles of

A graph in which every vertex has the same degree is called a:A. Complete graphB. Cycle graphC. Regular graphD. Bipartite graph