D1 Graph Definitions

?
  • Created by: Tassillow
  • Created on: 30-05-16 15:05
Vertices connected by edges
Graph
1 of 20
Graph where each edge has a value
Weighted
2 of 20
Part of a whole graph
Subgraph
3 of 20
The number of edges attached to a vertex
Degree
4 of 20
Going from one node to another, no return
Path
5 of 20
Going from one node to another, can revisit a node
Walk
6 of 20
Path where you end up where you began
Cycle
7 of 20
2 vertices with a path between them
Connected
8 of 20
All vertices Connected
Connected Graph
9 of 20
Starts and finishes at same vertex, nothing inbetween
Loop
10 of 20
Graph where edges have a direction
Directed
11 of 20
Graph with no loops, only one edge connects any pair of vertices
Simple
12 of 20
Connected graph, no cycles
Tree
13 of 20
Subgraph that contains all vertices of the graph and has no cycles
Spanning Tree
14 of 20
Graph with every node directly connected by an edge to every other node
Complete
15 of 20
2 sets of vertices X and Y, edges only join X node to Y node
Bipartite
16 of 20
Every node in X connected to every node in Y
Complete Bipartite
17 of 20
Graph showing same information but in different orientations
Isomorphic
18 of 20
A connected graph which has a closed trail containing every arc precisely once
Eulerian
19 of 20
A graph which has a trail that is not closed that contains every arc precisely once
Semi Eulerian
20 of 20

Other cards in this set

Card 2

Front

Graph where each edge has a value

Back

Weighted

Card 3

Front

Part of a whole graph

Back

Preview of the front of card 3

Card 4

Front

The number of edges attached to a vertex

Back

Preview of the front of card 4

Card 5

Front

Going from one node to another, no return

Back

Preview of the front of card 5
View more cards

Comments

No comments have yet been made

Similar Mathematics resources:

See all Mathematics resources »See all Networks, algorithms and problem solving resources »