Answer: B
Step-by-step explanation: Adjacency Matrix is a square matrix representing a simple graph with 0 or 1 according to the condition given.
In this diagram, 0 corresponds to no connection between airports and 1 corresponds to connections between airports.
In other words, analysing the image, we see that:
1) Albany just have connection with Atlanta, so in the position of line Albany with column At, it must be a 1. The other columns, there are 0.
The Line for Albany in the matrix will be: [0 1 0 0 0 0]
2) Atlanta has connections with Albany, Dalton, Macon and Augusta. So corresponding position (line and column) must be 1. The only two airports Atlanta doesn't have connection with its own and Waycross, so at the corresponding column and line, it is written 0.
The line for Atlanta in the matrix is [1 0 1 1 1 0]
3) Augusta: connections with Atlanta, Macon, Waycross. At those positions, it will be written 1. At positions related to itself, Albany and Dalton is 0.
The line in the matrix will be [0 1 0 0 1 1]
4) Dalton: connection with Atlanta only. That position will be 1 while the others will be 0.
The line is [0 1 0 0 0 0]
5) Macon: connections with Atlanta, Augusta and Waycon: those positions will have 1 and the other 0.
The line is [0 1 1 0 0 1]
6) Waycross: connections with Macon and Augusta. Those positions will be 1 and the others 0.
The line is [0 0 1 0 1 0]
In conclusion, the adjacency matrix matching the scenario is
[tex]A=\left[\begin{array}{cccccc}0&1&0&0&0&0\\1&0&1&1&1&0\\0&1&0&0&1&1\\0&1&0&0&0&0\\0&1&1&0&0&1\\0&0&1&0&1&0\end{array}\right][/tex]
