Graphs

Question 1

Connected graphs

Answer 1

Every nodes is connected to every other node

Question 2

Directed graph

Answer 2

All edges have a direction

Question 3

Weighted graph

Answer 3

All edges have a weight

Question 4

Labelled graph

Answer 4

All nodes have a label

Question 5

Tree graph

Answer 5

Connected graph without circuits

Question 6

Forest graph

Answer 6

Collection of non-connected tree graph

Question 7

Subgraph

Answer 7

Part of a larger graph

Question 8

Null graph

Answer 8

Graph with no edges

Question 9

Trivial graph

Answer 9

One node

Question 10

Simple graph

Answer 10

No loops, no parallel edges, undirected

Question 11

Undirected graph

Answer 11

No direction

Question 12

Complete graph

Answer 12

Contains all possible edges

Question 13

Disconnected graph

Answer 13

Not every node can visit each other

Question 14

Regular graph

Answer 14

Degree of all nodes are the same

Question 15

Cyclic graph

Answer 15

Edges form a cycle in the graph

Question 16

Acyclic graph

Answer 16

No cycles

Question 17

Multigraph

Answer 17

Multiple edges between same pair of nodes or to itself

Question 18

Minimum spanning tree

Answer 18

Tree of a connected, undirected and unweighted graph that connects all nodes in the graph with the smallest distance possible

Question 19

Adjacency matrix

Answer 19

Records number of connections between nodes of a graph

Question 20

Width of a graph

Answer 20

Maximum of the minimum distance between two nodes (largest distance between two nodes with the smallest possible edges used)

Question 21

Walk in a graph

Answer 21

Sequence of edges that connect nodes

Question 22

Trail

Answer 22

Walk with no repeated edges

Question 23

Path

Answer 23

Walk with no repeated edges and no repeated nodes

Question 24

Cycle

Answer 24

Path that starts and ends on the same node, the start and end node is an exception to no repeated nodes

Question 25

Eulerian trail

Answer 25

Trail (no repeated edges) that includes all edges in a graph

Question 26

Eulerian circuit

Answer 26

Eulerian trail with the same start and end node

Question 27

Hamiltonian path

Answer 27

Path (no repeated edges or nodes) that includes all nodes in the graph

Question 28

Hamiltonian cycle

Answer 28

Hamiltonian path that starts and ends at the same node

Question 29

Depth First Search

Answer 29

Goes down one route until dead end and backtracks to repeat, follows a stack