摘要
Gutman and Wagner(in the matching energy of a graph, Disc. Appl. Math., 2012) defined the matching energy of a graph and pointed out that its chemical applications go back to the 1970 s. Now the research on matching energy mainly focuses on graphs with pendent vertices and only a few papers reported the progress on matching energy of graphs without pendent vertices. For a random six-membered ring spiro chain, the number of k-matchings and the matching energy are random variables. In this paper, we determine the extremal graphs with respect to the matching energy for random six-membered ring spiro chains which have no pendent vertices.
Gutman and Wagner(in the matching energy of a graph, Disc. Appl. Math., 2012) defined the matching energy of a graph and pointed out that its chemical applications go back to the 1970 s. Now the research on matching energy mainly focuses on graphs with pendent vertices and only a few papers reported the progress on matching energy of graphs without pendent vertices. For a random six-membered ring spiro chain, the number of k-matchings and the matching energy are random variables. In this paper, we determine the extremal graphs with respect to the matching energy for random six-membered ring spiro chains which have no pendent vertices.
基金
Supported by the the National Natural Science Foundation of China(No.11551003)
Scientific research fund of the Science and Technology Program of Guangzhou(No.201510010265)
the Qinghai Province Natural Science Foundation(No.2015-ZJ-911)
