Some results on chemical energy of graphs

详细信息    查看全文

• 作者：Jianbin Zhang ; Bo Zhou ; ^{zhoubo@scnu.edu.cn" class="auth_mail}
• 关键词：Eigenvalues (of a graph) ; Chemical energy ; (Mathematical) energy ; Characteristic polynomial ; Unicyclic graphs
• 刊名：Discrete Applied Mathematics
• 出版年：1 October 2014
• 年：2014
• 卷：175
• 期：Complete
• 页码：94-103
• 全文大小：429 K

文摘

The chemical energy of an n$n$-vertex graph G$G$ is defined as Here 位₁(G),位₂(G),…,位_n(G)${位}_1\left(G\right),{位}_2\left(G\right),\dots ,{位}_n\left(G\right)$ are the eigenvalues of G$G$ arranged in non-increasing order. We give lower and upper bounds for the chemical energy of graphs, and determine the extremal unicyclic graphs with minimal and maximal chemical energies.