Science  People  Locations  Timeline
Index: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Home > Matching


 

This article is about mathematical matchings. For matching in the field of electronics, see: Impedance matching and Impedance bridging

In mathematics, a matching for a graph is a subset of edges without common vertices.

1 Formal definition

Let G = (V,E) be a (undirected) graph. A subset M of E is called matching of G if no two edges of M are coincident.

2 Special matchings

This article is a stub. You can help Wikipedia by [ ṣlocalurl: : |action=edit}} expanding it].



Read more »

Non User