On radius 2 trees with the maximum number of matchings

Abstract

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 trees of a given number of vertices. For any n≥56, where n=3k+r and k∈N,r∈{0,1,2}, an extremal tree is unique and it is a join of a vertex with the central vertices in b copies of P3 and with leaf vertices in a copies of P2, where b=k+r−1−2a3 and (r,a)∈{(0,1),(1,0),(2,2)}. For any 6≤n≤55, a corresponding extremal tree is also unique (except n=8, where there are two such trees) and it has a similar structure. For any 1≤n≤5, a unique extremal tree is the path on n 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.