MATCHING

Matching

In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices.

The above text is a snippet from Wikipedia: Matching (graph theory)
and as such is available under the Creative Commons Attribution/Share-Alike License.

matching

Noun

  1. A set of independent edges in a given graph, i.e. a set of edges which do not intersect: so-called because pairs of vertices are "matched" to each other one-to-one.

Verb

matching

Adjective

  1. The same as another; sharing the same design.
    ''A matching set of furniture


The above text is a snippet from Wiktionary: matching
and as such is available under the Creative Commons Attribution/Share-Alike License.

Need help with a clue?
Try your search in the crossword dictionary!