### Discrete Math: Graphs, Paths, and Circuits

Sandra Simpson

Lesson 14.1 Text "Thinking Mathematically"

 1 2 3 4 5 6 7 8 9 10 11 12 13 14

Across
4.When two vertices in a graph have at least one edge connecting them.
5.The pieces of a disconnected graph.
6.The points in a graph.
8.An edge if removed from a connected graph would leave a disconnected graph.
9.When graphs have the same number of vertices connected to each other in the same way.
11.A graph in which you can get from any vertex to any other vertex along a path. (It consists of one piece)
12.A vertex with an even number of edges attached to it.
13.A finite set of points, line segments or curves that start and end at vertices.
14.The movement along a graph that ends at a different vertex than it began.
Down
1.A vertex with an odd number of edges attached to it.
2.A graph that is not connected.
3.The number of edges at that vertex.
7.The line segments or curves in a graph.
10.An edge that starts and ends at the same vertex.
11.A path that begins and ends at the same vertex

Use the "Printable HTML" button to get a clean page, in either HTML or PDF, that you can use your browser's print button to print. This page won't have buttons or ads, just your puzzle. The PDF format allows the web site to know how large a printer page is, and the fonts are scaled to fill the page. The PDF takes awhile to generate. Don't panic!

 Web armoredpenguin.com