See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
15 cards from this deck
Points in a graph connected by edges
Lines connecting nodes/vertices
Number of edges meeting at that node
Graph where edges have numerical values (weights) representing distances, costs, etc.
Graph with edges showing direction of travel (arrows)
Moving along nnn edges, can revisit nodes
Walk where all nodes visited are different
Path that starts and ends at same vertex
∑degrees=2×number of edges\sum \text{degrees} = 2 \times \text{number of edges}∑degrees=2×number of edges
Which nodes are directly connected (using 0s and 1s)
Number of walks of length nnn between nodes
Connected graph with no cycles
Exactly one path connects any two nodes
Subgraph with all vertices from PPP forming a tree
Spanning tree with smallest possible total weight
Select your subjects, and get access to A+ resources today.