Graph Theory Flashcards

1
Q

When did graph theory start?

A

1736

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

Who proved that it’s impossible to walk such a
path?

A

Leonhard Eulers

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

A branch of mathematics that illustrates and analyzes connections
such as these

A

Graph theory

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

a set of points

A

Vertices

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

line segments or curves

A

Edges

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

an edge, the endpoints of which are the same vertex

A

Loop

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

a graph can be thought of as a movement from one vertex to another

A

Path

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

If a path ends at the same vertex at which it started

A

Closed path

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

A circuit that uses every edge but never uses the same edge twice

A

Eulers circuit

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

The number of edges that meet at a vertex

A

Degree of vertex

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

A graph that has an Euler’s circuit

A

Eulerian

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

A path that begins and ends at the same vertex and passes through each vertex of a graph exactly once

A

Hamiltonian Circuit

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

A graph that contains Hamiltonian circuit

A

Hamiltonian

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

If every vertex has degree of at least n/2

A

Dirac’s theorem

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

a graph in which each edge is associated with a value

A

Weighted graph

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

is so called because it has us choose the “cheapest” option at every chance we get

A

Greedy algorithm

17
Q

If the graph is drawn in such a way that no edges cross

A

Planar drawing

18
Q

the edges divide the graph into different regions

A

Faces

19
Q

The region surrounding the graph, or the exterior

A

Infinite face

20
Q

Euler’s formula

A

Vertices + Faces = Edges + 2

21
Q

Every planar graph has 4-colorable

A

Four color theorem

22
Q

The minimum number of colors needed to color a graph so that no edge connects vertices of the same color

A

Chromatic number of a graph

23
Q

29=8 mod 3

A

29-8/3 = 21/3 (7 an integer )