**Discrete mathematics glossary**

Below are links to pages containing definitions and examples of many discrete mathematics concepts. Included in the list are some concepts that are not cited specifically in the tours. We include them for you to tinker with on your own.

adjacent

algorithm

arc

arithmetic sequence

arrangement

bipartite

block

bridge

cardinality

center of a graph

central vertex

chromatic number

circuit

circular permutation

closed-form expression

colorability

coloring

combination

complete graph

complete *n*-partite

component

conjecture

connected

connected component

constant function

contradiction, proof by

converse

coordinate

coordinate graph

counterexample

crossing

crossing number

conjecture

counting permutations with repetition

covering

countable

Critical Path Method

cubic graph

cut vertex

cycle

cylindrical system

deductive reasoning

degree

degree sequence

denumerable

depth-first algorithm

derivative

derived function

Dijkstra's algorithm

diameter of a graph

difference of sets

digraph

dimension

dimension analysis

directed graph

direct proof

disconnected

disjoint sets

distance in a graph

domain

dominate

dominating number

dominating set

dual

earliest finish time, EFT

eccentricity

edge-chromatic number

edge colorability

edge coloring

edge connectivity

edge covering

edge-induced subgraph

edge

EFT

element

Eulerian circuit

Eulerian graph

Eulerian trail

Euler's theorem

exhaustive algorithm

explicit function expression

exponential function

factorial

FCP

Fibonacci number

Fibonacci sequence

finite sequence

First theorem of graph theory

fractal

function

forest

Four-color conjecture

Fundamental Counting Principle

generator

geometric sequence

graph

greedy algorithm

Hamiltonian cycle

Hamiltonian graph

Hamiltonian path

homeomorphic

implication

incident

inclusion/exclusion principle

indegree

indirect proof

indistinguishable elements

induced subgraph

induction

inductive proof

infinite sequence

input value

intersection of sets

initiator

intractable problem

isomorphic

isomorphism

join

Kuratowski's theorem

length

linear function

contrapositive

loop

map

mathematical induction

minimum dominating set

modus ponens

multigraph

multiset

negation

network

nodes

non-denumerable

non-isomorphic

nonplanar

nontrivial graph

*n*-partite

odometer method for listing permutations

one-to-one function

order of a graph

order of a set

ordered *n*-tuple

order-requirement network

orientation

oriented graph

origin

outdegree

paradox

partition of a graph

partition of a set

Pascal's triangle

path

permutation

pigeonhole principle

planar

planarity

polar coordinates

proof

proof by contradiction

proper subset

pseudograph

radius of a graph

range

rate of change

rectangular coordinates

rectangular system

recursive algorithm

recursive function

reductio ad absurdum

region

regular

Russell's paradox

relative complement of a set

repetition (in permutations)

self-similar

sequence

set

simple graph

sink

size of a graph

size of a set

slope

source

spanning cycle

spanning tree

spanning subgraph

spherical coordinates

strongly connected

subgraph

subset

successor

summation

theorem

trail

tree

tripartite graph

trivial graph

uncountable

underlying graph

union of sets

units

Venn diagram

vertex

vertex-chromatic number

vertex colorability

vertex coloring

vertex connectivity

vertex covering

vertex-induced subgraph

vertex

walk

weight

weighted graph

Copyright © 1999-2000 SciMathMN