GRAPHS Flashcards
(9 cards)
1
Q
A graph is connected if there is a path
connecting every pair of vertices.
A
Connected Graph:
2
Q
a graph withmultiple edges between the
same vertices. These edges are called parallel or multiple edges.
A
multigraph
3
Q
is a graph consisting of two different
sections.
A
Disconnected graph
4
Q
is an edge that connects a vertex to itself.
A
loop
5
Q
is a graph that has no loops or multiple
edges.
A
simple graph
6
Q
a graph with vertices, but no edges. It is
also an example of a disconnected graph.
A
Null graph
7
Q
is a vertex that has no edges
incident with it.
A
isolated vertex
8
Q
a vertex that has one edge incident
with it.
A
pendant vertex
9
Q
is a connected graph in which
every possible edge is drawn
between vertices (without any
multiple edges).
A
complete graph
