Contents
Chapter 1 · Corporate and Legal AffairsPractice
← Return to textbook

CONCEPT PRACTICE

Graph adjacency matrix example

1 related published questions. Take them one at a time.

Filter questions
Question sources

1 of 1 questions match.

ITPEC Practice
0/1 answered

Question 1 of 1

0/1 answered

2024 Autumn · Subject A · Q4

Original exam question · Select the image to enlarge
Read the question as text

Choose the undirected graph represented by the original adjacency matrix. Rows and columns are a, b, c, d, e, f in that order. Matrix rows: a: 0 1 0 0 0 0; b: 1 0 1 1 0 0; c: 0 1 0 1 1 0; d: 0 1 1 0 0 0; e: 0 0 1 0 0 1; f: 0 0 0 0 1 0. One means an edge and zero means no edge. Each choice below transcribes the edges of its original graph.

The original image above preserves the complete exam wording and layout.

Choose your answer
Choose an option to check your answer.
1 / 1Back to lesson →

Source: 2024A_FE-A_Questions.pdf, PDF page 5. ID: 2024A-A-Q004. Explanation written for this textbook.

Original question · Q4
Choose the undirected graph represented by the original adjacency matrix. Rows and columns are a, b, c, d, e, f in that order. Matrix rows: a: 0 1 0 0 0 0; b: 1 0 1 1 0 0; c: 0 1 0 1 1 0; d: 0 1 1 0 0 0; e: 0 0 1 0 0 1; f: 0 0 0 0 1 0. One means an edge and zero means no edge. Each choice below transcribes the edges of its original graph.

Scroll horizontally to read the image at full size.