WH LogoWH·CSBank
離散數學›Ch6 圖論
第 26 題／共 34 題
◀ LS 26/34
26. Directed Graph、Connectivity、Equivalence Closure
#LS-06-026中Directed GraphConnectivityEquivalence Closure
題組題幹（本題：3，共 4 小題）點擊展開

For questions 1–4, matrix A\mathbf{A} describes a binary relation R\mathbf{R} (rows and columns correspond to elements 1 to 6).

A=[000001001110000110000110000000000001]\mathbf{A} = \begin{bmatrix} 0 & 0 & 0 & 0 & 0 & 1 \\ 0 & 0 & 1 & 1 & 1 & 0 \\ 0 & 0 & 0 & 1 & 1 & 0 \\ 0 & 0 & 0 & 1 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 1 \end{bmatrix}

If G\mathbf{G} is a graph representation of R\mathbf{R}, which of the following statements are true?

📄 中央112
跳轉到第題
← 上一題下一題 →
▤完整推導請見《WH 資工筆記 · 離散數學》Ch6 圖論
本章題號 · 21–34 / 34
2122232425262728293031323334