On radius 2 trees with the maximum number of matchings
A matching in a graph is any set of its pairwise non-adjacent edges. In this paper, we consider and solve the maximization problem of the matchings number in radius ≤2\le2 trees of a given number of vertices. For any n≥56n\ge 56, where n=3k+rn=3k+r and k∈N,r∈{0,1,2}k\in{\mathbb N},r\in \{0,1,2\}, an extremal tree is unique and it is a join of a vertex with the central vertices in bb copies of P3P_3 and with leaf vertices in aa copies of P2P_2, where b=k+r-1-2a3b = k+\dfrac{r - 1 - 2a}{3} and (r,a)∈{(0,1),(1,0),(2,2)}(r,a)\in \{(0,1),(1,0),(2,2)\}. For any 6≤n≤556\le n\le 55, a corresponding extremal tree is also unique (except n=8n=8, where there are two such trees) and it has a similar structure. For any 1≤n≤51\le n\le 5, a unique extremal tree is the path on nn vertices. To prove these facts, we propose some graph transformations, increasing the matchings number and keeping the vertices number. The author hopes that these transformations will be useful for solving similar problems in other classes of graphs.