## Homework Hints 18-2

[tippy title=”Problems 1-2″]Problems 1-2
There are many problems throughout the text labeled IN YOUR OWN WORDS. Just relax; do not be afraid to give your opinion. For the most part, these questions do not have “right” or “wrong” answers. You … See the whole entry

## Homework Hints 15-3

[tippy title=”Problems 1-2″]Problems 1-2
There are many problems throughout the text labeled IN YOUR OWN WORDS. Just relax; do not be afraid to give your opinion. For the most part, these questions do not have “right” or “wrong” answers. You … See the whole entry

## Homework Hints 15-2

[tippy title=”Problems 1-2″]Problems 1-2
There are many problems throughout the text labeled IN YOUR OWN WORDS. Just relax; do not be afraid to give your opinion. For the most part, these questions do not have “right” or “wrong” answers. You … See the whole entry

## Individual Research Project Section 14.4

### Project 14.10

Select something that you think might be normally distributed (for example, the ring size of students at your college). Next, select 100 people and make the appropriate measurements (in this example, ring size). Calculate the mean and standard … See the whole entry

## 9.2 Outline

1. Trees
1. definition
2. spanning tree
2. Minimum spanning trees
1. weight
2. weighted graph
3. definition
4. Kruskal’s algorithm
5. number-of-vertices-and-edges-in-a-tree theorem

## 9.2 Essential Ideas

A tree is a graph which is connected and has no circuits. A tree that is created from another … See the whole entry

## 9.1 Outline

1. Euler circuits
1. Konigsberg bridge problem
2. definition of a graph (or a network)
3. traversable network
4. degree of a vertex
5. Euler circuit
6. odd/even vertex
7. connected network
8. Euler’s circuit theorem
2. Applications of Euler circuits
1. supermarket problem
2. police patrol problem
3. floor-plan problem
See the whole entry