Minimal energy of unicyclic graphs of a given diameter

被引:0
作者
Feng Li
Bo Zhou
机构
[1] South China Agricultural University,Department of Applied Mathematics, College of Science
[2] South China Normal University,Department of Mathematics
来源
Journal of Mathematical Chemistry | 2008年 / 43卷
关键词
energy; diameter; unicyclic graphs; characteristic polynomial; 05C50; 05C35;
D O I
暂无
中图分类号
学科分类号
摘要
The energy of a graph is defined as the sum of the absolute values of all the eigenvalues of the graph. For a given positive integer d with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$3\leqslant d\leqslant n-2$$\end{document}, we characterize the graphs with minimal energy in the class of unicyclic graphs with n vertices and a given diameter d.
引用
收藏
页码:476 / 484
页数:8
相关论文
共 16 条
[1]  
Gutman I.(2005)undefined J. Serb. Chem. Soc. 70 441-456
[2]  
Gutman I.(1977)undefined Theoret. Chim. Acta (Berlin) 45 79-87
[3]  
Hou Y.(2001)undefined J. Math. Chem. 29 163-168
[4]  
Yan W.(2005)undefined Appl. Math. Lett. 18 1046-1052
[5]  
Ye L.(1999)undefined J. Math. Chem. 29 145-169
[6]  
Li H.(2001)undefined Chem. Phys. Lett. 337 125-130
[7]  
Zhang F.(2005)undefined MATCH Commun. Math. Comput. Chem. 54 379-388
[8]  
Li Z.(2005)undefined J. Math. Chem. 37 423-431
[9]  
Wang L.(2005)undefined Discrete Appl. Math. 145 437-443
[10]  
Li F.(2006)undefined J. Math. Chem. 39 465-473