AI Tutor
Library
›Library›Mathematics›Discrete Mathematics: An Open Introduction›Graph Theory›Definitions
Back to Discrete Mathematics: An Open Introduction

Definitions

Graph, vertex, edge, degree, isomorphism and subgraph, established by asking which of several drawings represent the same graph.

Discrete Mathematics: An Open Introduction, Definitions

Status
FlagsLoading your progress…

3 exercises

Exercise 1

If 10 people each shake hands with each other, how many handshakes took place? What does this question have to do with graph theory?

2.5

Exercise 2

Among a group of 5 people, is it possible for everyone to be friends with exactly 2 of the people in the group? What about 3 of the people in the group?

2.5

Exercise 10

Decide whether the statements below about subgraphs are true or false. For those that are true, briefly explain why (1 or 2 sentences). For any that are false, give a counterexample.

  1. Any subgraph of a complete graph is also complete.

  2. Any induced subgraph of a complete graph is also complete.

  3. Any subgraph of a bipartite graph is bipartite.

  4. Any subgraph of a tree is a tree.

2.5
Chapter SummaryTrees

Adapted from Discrete Mathematics: An Open Introduction © 2013–2019 Oscar Levin. Licensed under CC BY-SA 4.0. Source: Discrete Mathematics: An Open Introduction. Imported at revision 1e2e26b.

AI Tutor

A study tool built on open educational resources. Content from OpenStax and other openly licensed textbooks — every book, section and exercise page carries its source’s license and attribution.

Product
  • About AI Tutor
  • Library
  • Premium
Legal
  • Terms of Service
  • Privacy Policy
© 2026 AI Tutor. Openly licensed content is attributed to its authors under their respective licenses.