-
In vertex-edge graphs, the location of the vertices is
O not important; the relationships are
not important; the edge-length is
important; the locations define the graph

In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph.

In the special case of a finite simple graph, the adjacency matrix is a (0,1)-matrix with zeros on its diagonal. If the graph is undirected, the adjacency matrix is symmetric. The relationship between a graph and the eigenvalues and eigenvectors of its adjacency matrix is studied in spectral graph theory.

The adjacency matrix should be distinguished from the incidence matrix for a graph, a different matrix representation whose elements indicate whether vertex–edge pairs are incident or not, and degree matrix which contains information about the degree of each vertex.

4400

step-by-step explanation:

c) the median for town a 30" is greater than the median for town b 25"

step-by-step explanation:

town a, median = q2 = 30

town b, median - q2 = 25

so the median for town a 30" is greater than the median for town b 25"