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).
An induced matching can also be described as an independent set in the square of the line graph of the given graph.[1]