Definitions from Wikipedia (Induced matching)

▸ noun:  In graph theory, an induced matching or strong matching is a subset of the edges of an undirected graph that do not share any vertices (it is a matching) and these are the only edges connecting any two vertices which are endpoints of the matching edges (it is an induced subgraph).


▸ Words similar to induced matching
▸ Usage examples for induced matching

▸ Idioms related to induced matching
▸ Wikipedia articles (New!)
▸ Words that often appear near induced matching
▸ Rhymes of induced matching

▸ Invented words related to induced matching