Question

14. Define the following:
(a) Path
(b) Connected graph
(c) Tree​

Answer 1

Answer:

PATH,

a trodden way a winding path through the woods. 2 : a track specially constructed for a particular use a garden path of flagstones. 3a : course, route the path of a meteor.

CONNECTED GRAPH,

In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements that need to be removed to separate the remaining nodes into isolated subgraphs. It is closely related to the theory of network flow problems.

TREE,

a tall plant that can live for a long time. Trees have a thick wooden central part from which branches grow.

Answer 2

__________________________________

Path

• 1 : a trodden way a winding path through the woods.

• 2 : a track specially constructed for a particular use a garden path of flagstones.

• 3a : course, route the path of a meteor.

__________________________________

Connected graph

• A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph.

• A graph that is not connected is said to be disconnected.

__________________________________

Tree

• A tree is a set of straight line segments connected at their ends containing no closed loops (cycles).

• In other words, it is a simple, undirected, connected, acyclic graph (or, equivalently, a connected forest).

• A tree with nodes has graph edges.

• Conversely, a connected graph with nodes and. edges is a tree.

__________________________________