Question: Exercise 1 (1 point for each correct answer) Consider the graph on the right. 1. Calculate its diameter. 2. Is it a bipartite graph? Why

Exercise 1 (1 point for each correct answer) Consider the graph on the right. 1. Calculate its diameter. 2. Is it a bipartite graph? Why or why not? 3. Find all vertices that have maximum closeness. 4. Find all vertices that have minimum closeness. 5. Calculate the local clustering coefficient of vertex E. Exercise 2 (1 pt) A tree is a connected graph without cycles. What is the global clustering coefficient of a tree on n vertices? Why
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
