A simple undirected graph with all vertices having the same degree is called:a.Complete graphb.Bipartite graphc.Regular graphd.Eulerian 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 with all vertices having equal degree is known as a __________

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

The necessary and sufficient condition for a graph to be Eulerian is:a.All vertices have even degreeb.All vertices have odd degreec.All vertices have the same degreed.There is a path between every pair of vertices

A simple directed graph in which every pair of distinct vertices is connected by an edge in both directions is called:a.Connected graphb.Eulerian graphc.Strongly connected graphd.Weakly connected graph