Author/Authors :
Jiping Liu، نويسنده , , Huishan Zhou، نويسنده ,
Abstract :
We provide a formula for the number of edges of a maximum induced matching in a graph. As applications, we give some structural properties of (k + 1)K2-free graphs, construct all 2K2-free graphs, and count the number of labeled 2K2-free connected bipartite graphs.
