Definitions

Question 1

Graph

Answer 1

Consists of vertices(nodes) connected by edges(arcs).

Question 2

Sub graph

Answer 2

Part of a graph

Question 3

Weighted graph

Answer 3

A graph in which a number is associated with each edge.

Question 4

Degree (of order)

Answer 4

In a graph, the number of edges incident to a vertex.

Question 5

Path (2)

Answer 5

A finite sequence of edges in a graph, where no vertex appears more than once.

The end vertex of one edge is the starting vertex of the next.

Question 6

Walk

Answer 6

A path where a vertex can be revisited more than once.

Question 7

Circuit

Answer 7

A closed path: the end vertex of the last edge is also the starting vertex of the first edge.

Question 8

Connected graph

Answer 8

A graph in which all the vertices are connected.

Question 9

A loop

Answer 9

In a graph, where an edge starts and finishes in at the same vertex

Question 10

Simple graph

Answer 10

A graph with no loops and the with no more than one edge connecting any pair of vertices

Question 11

Tree graph

Answer 11

A connected graph with no circuits

Question 12

Digraph

Answer 12

A graph which has a direction associated with its edges.

Question 13

Spanning tree

Answer 13

A sub graph including all the vertices of the original graph, and is also a tree

Question 14

Bipartite graph

Answer 14

Has two sets of vertices from one set to vertices of each other. There are no edges joining the sand set.

Question 15

Complete graph

Answer 15

A graph in which each vertex is directly connected to every other vertex.