Multiple choice A graph has adjacency matrix of all 1’s then it is fully connected its path matrix is same is adjacency matrix contains cycles all of the above Reveal answer Fill a bubble to check yourself D Correct answer Explanation null