Print Options

Card layout: ?

← Back to notecard set|Easy Notecards home page

Instructions for Side by Side Printing
  1. Print the notecards
  2. Fold each page in half along the solid vertical line
  3. Cut out the notecards by cutting along each horizontal dotted line
  4. Optional: Glue, tape or staple the ends of each notecard together
  1. Verify Front of pages is selected for Viewing and print the front of the notecards
  2. Select Back of pages for Viewing and print the back of the notecards
    NOTE: Since the back of the pages are printed in reverse order (last page is printed first), keep the pages in the same order as they were after Step 1. Also, be sure to feed the pages in the same direction as you did in Step 1.
  3. Cut out the notecards by cutting along each horizontal and vertical dotted line
To print: Ctrl+PPrint as a list

18 notecards = 5 pages (4 cards per page)

Viewing:

Graph theory

front 1

Graph

back 1

consists of points (called vertices or nodes) which are connected by lines (edges or arcs)

front 2

Weighted graph / network

back 2

A graph where the edges have associated values (weights)

front 3

Vertex set

back 3

A, B, C, D, E, F, the vertices within a graph

front 4

Edge set

back 4

AD, AE, BA, BC, CE, CF, DE, EF, the edges within the graph (G)

front 5

Subgraph of G

back 5

A graph, each of whose vertices belong to the original graph (G) and each of whose edges belong to G. It is simply a part of the original graph.

front 6

Degree, Order, or Valency of a vertex

back 6

The no. of edges incident to the vertex

A: 3, B: 2 etc.

front 7

Even vertex

back 7

vertex with an even degree

front 8

Odd vertex

back 8

vertex with an odd degree

front 9

Walk

back 9

A route through a graph along edges and from one vertex to another (can be multiple vertices and edges)

front 10

Path

back 10

A walk where no vertex is visited more than once

front 11

Trail

back 11

A walk where no edge is visited more than once

front 12

Cycle

back 12

A walk where the end vertex is the same as the start vertex and no vertex is visited more than once

front 13

Hamiltonian cycle

back 13

A cycle which includes every vertex.

front 14

Connected graph

back 14

Where every vertex is connected, in some way, to the graph. (Vertices are connected when there is an arc connecting them)

front 15

Loop

back 15

Edge that starts and finishes at the same vertex

front 16

Simple graph

back 16

A graph with no loops and up to one arc connecting the same two vertex

front 17

Directed graph

back 17

Graphs where direction is associated to each arc, often shortened to digraph

front 18

The Handshake Lemma

back 18

Th sum of the degrees of the vertices is equal to 2x the number of edges, as a consequence the number of vertices must be even. This is known as Euler's Handshake Lemma.