Keywords

#induced_matching

Induced matching

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 and these are the only edges connecting any two vertices which are endpoints of the matching edges.

Mon 29th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Induced matching Matching (graph theory) Induced subgraph Perfect matching Independence complex Ruzsa–Szemerédi problem Neighbourhood (graph theory) Glossary of graph theory Matching (statistics) Index-matching material
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.