Sign in to save your progress, vote, and build your own decks.Sign in
D1
Define graph
consists of vertices connected by edges
Define subgraph
graph whose vertices and edges belong to the original graph
Define weighted graph
a graph that has a number associated with each edge
Define degree/order/valency
number of edges incident to a vertex
Define path
finite sequence of edges such that the end vertex of one edge is the start of the next. No vertex
appears more than once.
Define cycle
a closed path, i.e. the end vertex of the last edge is the start vertex of the first edge