Graph 1 Graph 2 Q1. Define the following i. Graph ii. Incidence matrix iii. Adjacency Matrix iv. Degree of a node v. Paths vi. Directed Graph
Consider Graph 1 for Q2-Q7 Q2. Identify set of Nodes V and set of Edges E for Q3 List down the degree of each node Q4. Provide incidence matrix. Q5. Provide Adjacency matrix. Q6. Provide paths between following nodes n1-n5 n3-n2 Q7. Calculate cyclomatic complexity of the graph using formula Consider Graph 2 for Q8-Q7 Q8. List down indegree and outdegree of each node N2 N5 N1 N3 N4 N6 N7 e1 e4 e2 e5 e3 N2 N5 N1 N3 N4 N6 N7 e1 e4 e2 e5 e3 BVICAM,2014byAnukiran
Q9. Provide Adjacency matrix
Q10. Provide reachability matrix. Q11. Identify nodes which are i. 0-connected ii. 1-connected iii. 2-connected Q12. Draw a directed edge in graph 2 to make the node n3 and n6 as 3-connected