(a) Prove that every cut-set in a connected graph G must contain at l…

Question

(a) Prove that every cut-set in a connected graph G must contain at least one branch of every spanning tree of G.

(b) Define the following terms:

(i) Graphs

(ii) Walk

(iii) Path

(iv) Circuits

(v) Eular Graph

(vi) Hamiltonian Circuit

(vii) Trees

(c) Find the shortest path in the given below weighted graph using Djikstra's Algorithm. (Use A as starting Point).

Related pages

• Trees — topic
• Discrete Mathematics syllabus