Math 1029 test 3

If an edge is removed from a connected graph and leaves behind a disconnected​ graph, such an edge is called a

bridge

A​ z-score describes how many standard deviations a data item in a normal distribution lies above or below the

mean

A graph that is connected and has no circuits is called​ a/an ____________. For such a​ graph, every edge is​ a/an ____________, and if there are n​ vertices, there must be​ ___________ edges.

tree, bridge, n-1

The sum of the deviations from the mean for a data set is always zero.

true

A path that passes through each edge of a graph exactly one time is called​ a(n) __________ path

Euler

A method that approximates the solution to the salesperson problem is called the _______. Method. This method involves continually choosing an edge with the smallest _____________.

Hamilton weight

A path that passes through each vertex of a graph exactly once is called​ a/an _______ path. Such a path that begins and ends at the same vertex and passes through all other vertices exactly once is called​ a/an _______ circuit.

Hamilton, Hamilton

A procedure that yields the minimum spanning tree of a graph is called​ ___________ Algorithm. The idea of the algorithm is to always pick the edge with the smallest available​ ___________, but avoid creating any​ ___________.

Kruskals, weight, circuit

An edge can be a part of a path only once.

The statement is true because a path is a sequence of adjacent vertices and the edges connecting them

The​ mean, median, and mode of a normal distribution are all equal.

The statement is true.

A finite set of points connected by line segments or curves is called _______________ The points are called _________. The line segments or curves are called ________________. Such a line segment or curve that starts and ends at the same point is called a ____________.

a graph, vertices, edges, loop

If there is at least one edge connecting two vertices in a​ graph, the vertices are called _________________. A sequence of such vertices and the edges connecting them is called a _______________. If this sequence of vertices and connecting edges begins and ends at the same​ vertex, it is called a ____________.

adjacent, path, circuit

A method that determines the solution to the traveling salesperson problem involves listing all Hamilton circuits and selecting the circuit with the minimum sum of weights. This method is called the​ _______ Method.

brute force

A graph that has an edge between each pair of its vertices is called​ a/an ________ graph. If such a graph has n​ vertices, the number of Hamilton circuits in the graph is given by the factorial expression​ ______.

complete, (n-1)!

The number of edges that connect to a vertex is called the ____________ of the vertex

degree

Two graphs that have the same number of vertices connected to each other in the same way are called

equivalent

A tree that is created from a weighted graph and that has the smallest possible weight is called the​ _____________ tree.

minimum spanning

If​ n% of the items in a distribution are less than particular data​ item, we say the data item is in the nth ____________ of distribution

percentile

The difference between the highest and lowest data values in a data set is called the

range

A tree that is created from another connected graph and that contains all of the connected​ graph's vertices, is​ connected, and contains no circuits is called​ a/an ____________ tree.

spanning

A graph whose edges have numbers attached to them is called​ a/an ______ graph. The numbers shown along the edges of such a graph are called the​ ______ of the edges. The problem of finding a Hamilton circuit for which the sum of these numbers is a minimum is called the​ ______ salesperson problem. Such a Hamilton circuit is called the​ ______ solution.

weighted, weights, traveling, optimal