See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Matrix showing edges connecting each pair of vertices in a graph
n×nn \times nn×n square matrix
Number of edges between the two vertices
No edge connecting those two vertices
Exactly one edge connecting those two vertices
Single edge connecting a vertex to itself
On the diagonal (where row and column labels match)
Vertices in 2 groups; edges only between groups, not within
Matrix is symmetric (entry at A,B equals entry at B,A)
Vertex names (e.g., AAA, BBB, CCC, DDD, EEE)
Show more
Select your subjects, and get access to A+ resources today.