See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Every vertex can reach every other vertex via edges
At least one pair of vertices with no connecting path
Edge that if removed would disconnect the graph
Graph becomes disconnected
Graphs with same vertices, edges, and connection patterns
Same number of vertices and same number of edges
Square matrix recording edges between each pair of vertices
No direct edge connects those two vertices
Symmetric for undirected graphs
On the diagonal
Show more
Select your subjects, and get access to A+ resources today.