NETWORK IN A GRAPH THEORY

An (a)   is a line which connects two vertices.

The __________ is the number of edges which connects two vertices.

• subgraph

• network

• degree

• tree

The graph without a __________ and without multiple edges is known as a __________.

• tree

• loop

• sum of degree

• simple graph

Edges of a __________ are associated with directions.

• directed graph

• undirected graph

• weighted graph

• unweighted graph

Edges of a __________ are associated with values or information.

• directed graph

• undirected graph

• weighted graph

• unweighted graph

A __________ is a part of a graph or the whole graph redrawn.

• network

• graph

• subgraph

• vertice

Every pair of vertices in a __________ is connected by an edge only.

• edge

• tree

• unweighted graph

• undirected graph