Saturation (graph theory)
Let be a graph and a matching in . A vertex is said to be saturated by if there is an edge in incident to . A vertex with no such edge is said to be unsaturated by . We also say that saturates .[1]
See also
References
This article is issued from Wikipedia - version of the 1/31/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.