Skip to ContentGo to accessibility page

Key Terms

12.1 Graph Basics

  • vertex
  • edge
  • loop
  • graph (simple graph)
  • multigraph
  • adjacent (neighboring)
  • degree

12.2 Graph Structures

  • complete
  • subgraph
  • cycle
  • cyclic subgraph
  • clique

12.3 Comparing Graphs

  • isomorphic
  • isomorphism
  • planar
  • nonplanar
  • complement
  • complementary

12.4 Navigating Graphs

  • walk (directed walk)
  • trail (directed trail)
  • path (directed path)
  • closed
  • open
  • closed walk
  • circuit (closed trail)
  • directed cycle (closed path)
  • coloring (graph coloring)
  • nn-coloring
  • chromatic number

12.5 Euler Circuits

  • connected
  • component
  • disconnected
  • Euler circuit
  • Eulerian graph
  • Chinese postman problem
  • Eulerization

12.6 Euler Trails

  • algorithm
  • Fleury’s algorithm
  • Euler trail
  • bridge
  • local bridge

12.7 Hamilton Cycles

  • Hamilton cycle, or Hamilton circuit
  • nn factorial
  • weighted graph
  • total weight

12.8 Hamilton Paths

  • Hamilton path

12.9 Traveling Salesperson Problem

  • brute force algorithm
  • greedy algorithm
  • traveling salesperson problem (TSP)
  • brute force method
  • nearest neighbor method

12.10 Trees

  • acyclic
  • tree
  • forest
  • path graph or linear graph
  • star tree
  • root
  • starlike tree
  • caterpillar tree
  • lobster tree
  • spanning tree
  • minimum spanning tree
Citation/Attribution
Reuse and redistribution of this content in digital or print format:
  • This book may not be used in the training of large language models or otherwise be ingested into large language models or generative AI offerings without OpenStax's prior written permission.
  • This book uses the Creative Commons Attribution-NonCommercial-ShareAlike License, which means that you can reuse and modify the material only for noncommercial purposes, must attribute OpenStax, and must distribute any derivative works under the same license.
  • Any commercial printing of this textbook, including using a local or custom printer, must be approved by OpenStax, and proper citation provided.
  • OpenStax-copyrighted images, activities, assessments, and similar components of this book are subject to the same licensing – CC-BY-NC-SA. They can be used for noncommercial purposes with attribution. Commercial use requires permission.
  • Permission requests: Anyone who intends to incorporate this content (including text, images, and other components) into large language models, use it in AI offerings, use it commercially (including in print), and/or has questions about another use case is welcome to complete our reuse request form.
Attribution information
  • If you are redistributing all or part of this book in a noncommercial print format, then you must include on every physical page the following attribution:

    Access for free at https://openstax.org/books/contemporary-mathematics/pages/1-introduction

  • If you are redistributing all or part of this book in a noncommercial digital format, then for every page that includes OpenStax content, you must license the derivative work under the same CC-BY-NC-SA license as the original, and include on every digital page view the following attribution:

    Access for free at https://openstax.org/books/contemporary-mathematics/pages/1-introduction

Citation information

The information below includes the information needed to generate citations in most major styles (APA, MLA, etc.); you must reformat and organize the information as needed to fit the requirements of the style. Use the information below to generate a citation. We recommend using a citation tool such as this one.

© Apr 23, 2026 OpenStax. Textbook content produced by OpenStax is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike License. The OpenStax name, OpenStax logo, OpenStax book covers, OpenStax CNX name, and OpenStax CNX logo, and Rice University name, and Rice University logo trademarks, or wordmarks are not subject to the Creative Commons license and may not be reproduced without the prior and express written consent of Rice University.