1
								2			3				4
				5
														6
		7																						8
9
																	10
					11								12
				13														14
																				15
	16
								17
18							19
			20																		21
																				22
	23
																						24
25																26
																			27

Across 4. The line segments or curves in a graph. 5. When graphs have the same number of vertices connected to each other in the same way. 6. A set of procedural rules. 9. A subgraph that contains all of a connected graph's vertices, is connected, and contains no circuits. 10. The pieces of a disconnected graph. 13. A set of vertices and edges chosen from those of an original graph. 15. A path that begins and ends at the same vertex 16. A graph in which you can get from any vertex to any other vertex along a path. (It consists of one piece) 17. A graph that is not connected. 18. The movement along a graph that ends at a different vertex than it began. 19. The number of edges at that vertex. 20. A graph whose edges have numbers attached to them. 22. An edge if removed from a connected graph would leave a disconnected graph. 23. A path that begins and ends at the same vertex and passes through all other vertices exactly once. 25. Edges containing the same set of vertices. 26. A vertex with an odd number of edges attached to it. 27. An edge that starts and ends at the same vertex.

Down 1. The numbers shown along the edges of a weighted graph. 2. A vertex with an even number of edges attached to it. 3. The points in a graph. 4. A path that travels through every edge of a graph once and only once. 7. A path that passes through each vertex of a graph exactly once. 8. A weighted graph (tree) with the smallest possible total weight. 11. A circuit that travels through every edge of a graph once and only once. (Begins and ends at the same vertex) 12. When two vertices in a graph have at least one edge connecting them. 14. A connectedngraph that has an edge between each pair of its vertices. 21. A graph that is connected and has no circuits. 24. A finite set of points, line segments or curves that start and end at vertices.