Graph Theory

Question 1

Studies network and connectivity.

Answer 1

Graph Theory

Question 2

A study that has helped us build the internet.

Answer 2

Graph Theory

Question 3

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

Answer 3

Graphs

Question 4

What is the birth of Graph Theory attributed to?

Answer 4

Seven Bridges of Konigsberg

Question 5

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

Answer 5

Leonhard Euler

Question 6

The year Graph Theory was introduced is?

Answer 6

1736

Question 7

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

Answer 7

Graph

Question 8

What are the main points of a graph?

Answer 8

Nodes/Vertices

Question 9

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

Answer 9

Edges

Question 10

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

Answer 10

Network

Question 11

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

Answer 11

Directed/Diagraph

Question 12

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

Answer 12

Undirected

Question 13

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

Answer 13

Path

Question 14

The number of edges in a path.

Answer 14

Length of a Path

Question 15

A path that begins and ends at the same vertex.

Answer 15

Circuit

Question 16

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

Answer 16

Cycle

Question 17

Cycles with length one.

Answer 17

Loops

Question 18

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

Answer 18

Connected

Question 19

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

Answer 19

Simple Graph

Question 20

A connected graph that has no cycles.

Answer 20

Tree

Question 21

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.

Answer 21

Euler Graphs

Question 22

Route of Euler Graphs that are not unique.

Answer 22

Eulerian trail.

Question 23

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.

Answer 23

Hamiltonian Graphs

Question 24

Route of Hamiltonian Graphs.

Answer 24

Hamiltonian Cycle

Question 25

A kind of tree that minimizes the lengths (or “weights”) of the edges of the tree.

Answer 25

Minimum Spanning Tree

Question 26

Equation of the cost of the spanning tree.

Answer 26

Sum of the weights of all the edges in the tree

Question 27

Finds the “shortest” route from one vertex to another.

Answer 27

Shortest Path Algorithm