Extremal matching energy of complements of trees
Abstract: The matching energy is defined as the sum of the absolute values of the zeros of the matching polynomial of a graph, which is proposed first by Gutman and Wagner [The matching energy of a graph, Discrete Appl. Math. 160 (2012) 2177–2187]. And they gave some properties and asymptotic results of the matching energy. In this paper, we characterize the trees with vertices whose complements have the maximal, second-maximal and minimal matching energy. Further, we determine the trees with a perfect matching whose complements have the second-maximal matching energy. In particular, show that the trees with edge-independence number number whose complements have the minimum matching energy for .
AMS classification: 05C05; 05C35; 92E10
Keywords: Matching polynomial; Matching energy; Hosoya index; Energy
All graphs only considered in this paper are undirected simple graphs. For notation and terminologies not defined here, see . Let be a graph with the vertex set and the edge set . Denote by or the graphs obtained from by removing or , respectively, where and . Denote by the complement of . The path, star and complete graph with vertices are denoted by , and , respectively. Let be a tree obtained from the star by attaching a path to one of the pendent vertices of , and let be a tree obtained from the star by attaching two paths and to two of the different pendent vertices of respectively. Let be a tree with vertices obtained from the star by attaching a pendent edge to each of pendent vertices in for .
A -matching in is a set of pairwise non-incident edges. The number of -matchings in is denoted by . Specifically, , and for or . For a -matching in , if has no -matching such that , then is called a maximum matching of . The number of edges in a maximum matching is called the edge-independence number of . Let denote the set of trees with vertices and the edge-independence number at least for . The Hosoya index is defined as the total number of matchings of , that is
Recall that for a graph on vertices, the matching polynomial of (sometimes denoted by with no confusion) is given by
Its theory is well elaborated [2, 4, 5, 6, 7]. Gutman and Wagner  gave the definition of the quasi-order as follows. If and have the matching polynomials in the form (1), then the quasi-order is defined by
Particularly, if and there exists some such that ,
then we write .
Gutman and Wagner in  first proposed the concept of the matching energy of a graph, denoted by , as
Meanwhile, they gave also an other form of definition of matching energy of a graph. That is,
where denotes the root of matching polynomial of . Additionally, they found some relations between the matching energy and energy (or reference energy). By (2) and (3), we easily obtain the fact as follows.
This property is an important technique to determine extremal graphs with the matching energy.
Note that the energy (or reference energy) of graphs are extensively examined (see [1, 2, 3, 9, 10, 14]). However, the literatures on the matching energy are far less than that on the energy and reference energy. Up to now, we find only few papers about the matching energy published. Gutman and Wagner  gave some properties and asymptotic results of the matching energy. Li and Yan  characterized the connected graph with the fixed connectivity (resp. chromatic number) which has the maximum matching energy. Ji et al. in  determined completely the graphs with the minimal and maximal matching energies in bicyclic graphs. Li et al.  characterized the unicyclic graphs with fixed girth (resp. clique number) which has the maximum and minimum matching energy.
In this paper, inspired by the idea , we investigate the problem of the matching energy of the complement of trees and obtain the following main theorems.
Let be a tree with vertices. If and , then
Let denote the set of trees with vertices and the edge-independence number at least for . For a tree , then
with equality if and only if .
The components of and have the maximum and minimum matching energy in all components of trees, respectively.
Let be a proper subset of containing all trees with a perfect matching. Suppose that , and . If , then
where the equality holds if and only if .
2 Some Lemmas
There exists a well-known formula which characterizes the relation between and (see Lovász ), which will play a key role in the proofs of the main theorems.
() Let be a simple graph with vertices and the complement of . Then
where , and .
The following results about the matching polynomial of can be found in Godsil .
The matching polynomial satisfies the following identities:
if is an edge of ,
() Let and be two positive integers. Then
() If is a tree with vertices and edge-independence number , then has at most vertices of degree one. In particular, if T has exactly vertices of degree one, then every vertex of degree at least two in is adjacent to at least one vertex of degree one.
3 Ordering complements of trees with respect to their matchings
For convenience, we use the same definitions of trees which are defined in .
Let and be the trees with vertices defined in Definition 3.1. Then .
By Lemma 2.2,
where the above sums range over all vertices of adjacent to . Hence
By (6) and a routine calculation,
For an arbitrary vertex adjacent to in , let be the forest , which has vertices. By (5), we obtain
Note that and . Hence
Note that has vertices. So
By the definition of and (10), we have , which implies . Particularly, if , then . By (2), . ∎
Let and be two trees with vertices defined in Definition 3.2. Then .
Similar to the proof of Theorem 3.1, we can obtain that
Furthermore, we also have
By the definition of and (11), we have , which implies . Specially, if then . This means, by (2), that . The proof is complete. ∎
Let and be two trees with vertices defined in Definition 3.3. Then .
Similar to the proof of Theorem 3.1, we have
By the definition of and (12), we have , which indicates . Specially, when , then . By (2), we get that . ∎
Suppose that and are two trees with () vertices and with () vertices, respectively. Take one vertex of and one of . Construct two trees and with vertices as follows. The vertex set of is and the edge set of is . is the tree obtained from and by identifying the vertex of and the vertex of and adding a pendent edge to this new vertex (). The result graphs see Fig. 4. We designate the transformation from to as of type 4 and denote it by : or .
Let and be two trees with vertices defined in Definition 3.4. Then .
By Lemma 2.2,
where the first sum ranges over all vertices () of adjacent to and the second sum ranges over all () of adjacent to . By (15) and (16), we have
Combining (13), (14), (17) and (18),
As in the proof of Theorem 3.1, we can show that
which implies that
Note that when . So, by (2), the theorem holds. ∎
Let and be two trees with vertices defined in Definition 3.5. Then .
By Lemma 2.2,
where the sum ranges over all vertices of incident with .
By (20) and (21), we have
By Lemma 2.4, there exists at least one pendent vertex in joining vertex of . Hence, , which implies that
Similar to the proof of Theorem 3.1,
where for every vertex () of incident with . Hence . Furthermore, if , then . So . ∎
Let and be two trees with vertices defined in Definition 3.6. Then .