DS102(MIDTERM)

consists of a non-empty set of vertices or nodes V and a set of edges E.

largest vertex degree of that graph.

is the number of edges incident with the vertex V.

has no edges

The study of graphs, an important part of a number of disciplines in the fields of mathematics, engineering and computer science

when the ordered vertex pair make up the edge set

if in a graph multiple edges between the same set of vertices are allowed, a graph having at least one loop or multiple edges. Like simple graphs, but there may be more than one edge connecting two given nodes.

the unordered vertex pair make up the edge set

if the degree of a vertex is even

if the graph is undirected and does not contain any loops or multiple edges