Some results on energy of unicyclic graphs with n vertices |
| |
| Authors: | Ying Liu |
| |
| Affiliation: | (1) Department of Computing Science, Huaiyin Institute of Technology, Huaian, Jiangsu, 223000, People’s Repuplic of China; |
| |
| Abstract: | A unicyclic graph is a connected graph whose number of edges is equal to the number of vertices. Hou (J Math Chem 29:163–168, 2001) first considered the minimal energy for general unicyclic graphs. In this paper, we determine the unicyclic graphs with the minimal energy in Unl{mathcal {U}_n^l} and the unicyclic graphs with the first forth smallest energy in Un (n 3 13){mathcal {U}_n,(ngeq 13)} vertices. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
