The Maximal Matching Energy of Tricyclic Graphs

Abstract

Gutman and Wagner proposed the concept of the matching energy (ME) and pointed out that the chemical applications of ME go back to the 1970s. Let $G$ be a simple graph of order $n$ and ${\mu }_1,{\mu }_2,\dots ,{\mu }_n$ be the roots of its matching polynomial. The matching energy of $G$ is defined to be the sum of the absolute values of ${\mu }_i(i=1,2,\dots ,n)$. Gutman and Cvetkoić determined the tricyclic graphs on $n$ vertices with maximal number of matchings by a computer search for small values of $n$ and by an induction argument for the rest. Based on this result, in this paper, we characterize the graphs with the maximal value of matching energy among all tricyclic graphs, and completely determine the tricyclic graphs with the maximal matching energy. We prove our result by using Coulson-type integral formula of matching energy, which is similar as the method to comparing the energies of two quasi-order incomparable graphs.

16 pages, 4 figures, MATCH Communications in Mathematical and in Computer Chemistry, 2014

Cited by in corpus (2)

• The matching energy of random graphs
• Matching Energy of Unicyclic and Bicyclic Graphs with a Given Diameter