Graph Theory Flashcards

(27 cards)

1
Q

Studies network and connectivity.

A

Graph Theory

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

A study that has helped us build the internet.

A

Graph Theory

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

Used to represent networks of communication, data organization, computational devices, the flow of computation, etc.

A

Graphs

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

What is the birth of Graph Theory attributed to?

A

Seven Bridges of Konigsberg

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

Who is the mathematician attributed to the birth of Graph Theory?

A

Leonhard Euler

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

The year Graph Theory was introduced is?

A

1736

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

What is a set of nodes of vertices linked by edges?

A

Graph

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

What are the main points of a graph?

A

Nodes/Vertices

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

What do you call the arcs or branches of a grapah?

A

Edges

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

What term is used when attributes are given to the vertices and/or edges?

A

Network

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

What do you call a graph whose edges are not all bidirectional?

A

Directed/Diagraph

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

What do you call a graph where no edge is bidirectional?

A

Undirected

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

A sequence of distinct edges that join two nodes through other nodes.

A

Path

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

The number of edges in a path.

A

Length of a Path

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

A path that begins and ends at the same vertex.

A

Circuit

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

What do you call it if a path connects a node to itself?

17
Q

Cycles with length one.

18
Q

What do you call it if two distinct nodes are linked by at least one path?

19
Q

A graph that has no loops and has no edges that repeat.

20
Q

A connected graph that has no cycles.

21
Q

A graph where it is possible to find a route that starts from one vertex, traverses every edge exactly once, and ends at the starting veretex.

22
Q

Route of Euler Graphs that are not unique.

A

Eulerian trail.

23
Q

A graph wherein it is possible to find a route that starts with one vertex, visits every vertex exactly once along incident edges, and ends at the starting vertex.

A

Hamiltonian Graphs

24
Q

Route of Hamiltonian Graphs.

A

Hamiltonian Cycle

25
A kind of tree that minimizes the lengths (or "weights") of the edges of the tree.
Minimum Spanning Tree
26
Equation of the cost of the spanning tree.
Sum of the weights of all the edges in the tree
27
Finds the "shortest" route from one vertex to another.
Shortest Path Algorithm