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

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

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

A simple undirected graph with all vertices having the same degree is called:a.Complete graphb.Bipartite graphc.Regular graphd.Eulerian graph

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

A graph can be defined as a collection of:a.Verticesb.Edgesc.Both vertices and edgesd.None of the above