Graph words Flashcards

1
Q

Nodes/Vertices

A

Dots of a graph

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Arcs/Edges

A

Lines of a graph

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Graph

A

Series of nodes connected by edges

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Degree of a vertex

A

How many ends of edges there are

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Total order in a connected graph

A

Must be even unless there is a loop

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Connected Graph

A

A graph where it is possible to go from any vertex to any vertex

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Loop

A

An edge that connects to the same vertex

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Simple graph

A

Graph with no loops and no multiple edges between any two vertices

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Complete graph

A

Every vertex is connected to every other vertex

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Kn

A

Complete graph with n vertices

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Number of arcs in Kn

A

(n^2-n) / 2

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Digraph

A

Graph where at least one edge has a direction associated to it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Bipartite graph

A

Nodes are in two distinct sets
Every edge connects a member of one set to the other

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Trail

A

A sequence of joined up edges so that no edge is repeated

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Path

A

A sequence of joined up nodes where no node is repeated

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Cycle

A

A closed path

17
Q

Tree

A

A connected graph with no cycle

18
Q

Spanning tree

A

Subgraph of another graph
Is a tree

19
Q

Eulerian graph

A

Possible to make a trail that uses all edges once, starting and ending at the same vertex
No nodes with odd degree

20
Q

Semi-Eulerian graph

A

Possible to make a trail that uses all edges once, starting and ending at different vertices
Exactly two points with odd degree