Given a graph , another graph is -saturated if does not contain a (not necessarily induced) copy of , but adding any edge to it does. The function is the minimum number of edges an -saturated graph on vertices can have.[1]


In matching theory, there is a different definition. 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 .

See also

References


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.