☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
資料結構
›
Ch6 圖形
第 21 題／共 26 題
◀
DS 21/26
錯題回報
00:00
21. Adjacency Matrix、Graph Representation
#DS-06-021
易
Adjacency Matrix
Graph Representation
📝
☆
Let
G
=
(
V
,
E
)
G=(V,E)
G
=
(
V
,
E
)
be an undirected graph with n vertices, where
n
>
1
n>1
n
>
1
, and M be the adjacency-matrix of G. Which of the following statement(s) is (are) correct.
A
(A) M is a symmetric matrix.
B
(B) The degree of vertex i is equal to the ith row sum.
C
(C) The number of edges of G is equal to
∑
i
=
1
n
∑
j
=
1
n
M
(
i
,
j
)
\sum_{i=1}^{n}\sum_{j=1}^{n}M(i,j)
∑
i
=
1
n
∑
j
=
1
n
M
(
i
,
j
)
D
(D) The graph has an even number of vertices of odd degree.
E
(E) The graph has an even number of vertices of even degree. (Note that 0 is defined as an even number.)
📝 寫筆記
📄 交大111
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 資料結構》Ch6 圖形
‹
本章題號 · 21–26 / 26
›
全部 26
易 23
中 3
難 0
21
22
23
24
25
26
