AlgoQuiz#1-Finals

If each pair of nodes or vertices in a graph G=(V,E) has only one edge, it is called:

• A multigraph

• A simple graph

• A complete graph

• A pseudograph

The type of graph where the number of vertices and edges in the graph is limited in number.

• Finite Graph

• Infinite Graph

• Trivial Graph

• Simple Graph

The type of graph where it contains only a single vertex and no edges.

• Finite Graph

• Infinite Graph

• Trivial Graph

• Simple Graph

The type of graph where it has numerous edges between a pair of vertices and no self-loops.

• A pseudograph

• A null graph

• A complete graph

• A multigraph

The type of graph where it contains several vertices but no edges connecting them.

• A pseudograph

• A null graph

• A complete graph

• A multigraph

The type of graph where it has self-loops and multiple edges.

• A pseudograph

• A null graph

• A complete graph

• A multigraph

If a graph G=(V,E) contains a self-loop besides other edges, it is called:

• A pseudograph

• A null graph

• A complete graph

• A multigraph

If a graph G=(V,E) is a simple graph with the same degree at each vertex, it is called:

• A pseudograph

• A regular graph

• A complete graph

• A multigraph

A graph G=(V,E) is called a labeled or weighted graph if:

• It has the same degree at every vertex.

• Each edge has a value representing the cost of traversing it.

• It has self-loops and multiple edges between vertices.

• It has no edges between vertices.

In a graph G=(V,E), the graph is considered connected if:

• There is a self-loop at every vertex.

• There is a path between one vertex and any other vertex in the graph.

• Each vertex has the same degree.

• The graph contains no edges.