Extremal values of matching energies of one class of graphs

Extremal values of matching energies of one class of graphs
复制标题

DOI:
10.1016/j.amc.2015.10.025
复制
发表时间:
2016-01-15
影响因子:
4
通讯作者:
Liu, Jinfeng
Liu, Jinfeng
中科院分区:
数学2区
文献类型:
--
作者:
Chen, Lin;Liu, Jinfeng

文献摘要

被引文献

相似文献

In 1978, Gutman proposed the concept of graph energy, defined as the sum of the absolute values of eigenvalues of the adjacency matrix of a molecular graph, which is related to the energy of pi-electrons in conjugated hydrocarbons. Recently, Gutman and Wagner proposed the concept of matching energy and pointed out that the chemical applications of matching energy go back to the 1970s. In this paper, we study the extremal values of the matching energy and characterize the graphs with minimal matching energy among all tricyclic graphs with a given diameter. Our methods can help to find more extremal values for other classes of molecular networks and the results suggest the structures with extremal energies. (C) 2015 Elsevier Inc. All rights reserved.