Graph Theory

Graph is made up of a set of vertices

Vertices are connected by edges

A graph contains a minimum of one vertex and one edge

Degree is the number of edges connected to two vertices

True

False

9

12

18

20

Directed edges are used in undirected graphs, while undirected edges are used in directed graphs.

Directed edges have a specific direction, while undirected edges do not.

Directed edges are bidirectional, while undirected edges are unidirectional.

Directed edges have no specific direction, while undirected edges do.

The degree of a vertex is the number of vertices connected to it

The degree of a vertex in a graph is the number of edges incident to that vertex.

The degree of a vertex is the number of cycles it is a part of

The degree of a vertex is the sum of the weights of the edges connected to it

Adjacent vertices are vertices that are connected by a curve in a graph.

Adjacent vertices are vertices that are not connected by an edge in a graph.

Adjacent vertices are vertices that are connected by a diagonal edge in a graph.

Adjacent vertices are vertices that are connected by an edge in a graph.

Edges are the colors used to represent different nodes in a graph.

Edges are the labels assigned to vertices in a graph.

Edges are the shapes that connect nodes in a graph.

Edges are the connections between vertices or nodes in a graph.

Vertices in a graph are the points where edges meet or intersect.

Vertices in a graph are the angles formed by the edges.

Vertices in a graph are the lines connecting the points.

Vertices in a graph are the labels assigned to the edges.