Upgrade to remove ads
Math 61 Post-Midterm 2
Terms in this set (16)
subset M of E of edges such that no two edges in M are incident on the same vertices. Matching covers set S of vertices if every vertex in S is incident to some edge in M
graph such that for every u,v of vertices in V, there is exactly one simple path from u to v
tree where one vertex is designated as the root
graph has no cycles
T, a tree in G, such that T has every vertex in G. T must use at least one edge from every cutset
minimal spanning tree
T, a spanning tree in G, such that the total weight is as small as possible. Can find using Prim's Algorithm
in a graph is a partition of V into two sets
set of edges incident to vertex in R and vertex in S of cut
height of rooted tree
largest n such that there is some vertex at level n
level of a tree
1 more than the number of edges between given nodes and the root
child of vertex
if vertex is at level n, children are neighbors at level n+1
vertex with no children
rooted tree where every vertex has either 0, 1, or 2 children
complete binary tree
binary tree of height h such that every vertex at level n for n<h has two children.
has 2^n vertices at each level.
has 2^h total leaves.
has 2^h-1 total internal vertices
full binary tree
binary tree where every vertex has either 0 or 2 children
THIS SET IS OFTEN IN FOLDERS WITH...
Math 61 Midterm 1
Math 61 Midterm
YOU MIGHT ALSO LIKE...
Trees Computer Sceince
Maths Graph Theory Terms 📈
OTHER SETS BY THIS CREATOR
GE Cluster Vocab List
Last Psych Quiz
Learning, Memory, Thought Test (23-31)
Mod 13-16, 32 Test