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. |