What is a complete graph?a.A graph in which every vertex is connected to every other vertexb.A graph with no edgesc.A graph with only one vertexd.A graph with parallel edges

Define complete graph and complete bipartite graph. Draw a graph which is a complete graph as well asa 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 graph in which every vertex has the same degree is called a:A. Complete graphB. Cycle graphC. Regular graphD. Bipartite graph

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

Which of the following is not a special type of graph?A. Complete graphB. Cycle graphC. Connected graphD. Wheel graph