Graph Theorymedium
0:00.0
A matching in a graph is a set of edges such that no two edges share a vertex. A maximal matching is a matching that cannot be extended by adding more edges. For a path graph , what is the size of a maximal matching?
A matching in a graph is a set of edges such that no two edges share a vertex. A maximal matching is a matching that cannot be extended by adding more edges. For a path graph , what is the size of a maximal matching?