試卷名稱:104年 - 104 國立交通大學_碩士班考試入學試題_資訊聯招:資料結構與演算法#113199
年份:104年
科目:研究所、轉學考(插大)◆資料結構與演算法
24. Let G=(V, E) be an undirected graph with n vertices, where n >1, and M be the adjacency matrix of G. Which of the following statements is not correct?
(A) M is a 2-dimension nxn array.
(B) M is symmetric.
(C) The degree of any vertex i is equal to the ith row sum.
(D) The graph has an even number of vertices of odd degree.
(E) The number of edges of G is equal to
M(i, j).