Note on the Minimal Energy Ordering of Conjugated Trees
For a simple graph G, the energy E(G) is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix A(G). Gutman proposed two conjectures on the minimal energy of the class of conjugated trees (trees having a perfect matching). Zhang and Li determined the trees in the class with the minimal and second-minimal energies, which confirms the conjectures. Zhang and Li also found that the conjugated tree with the third-minimal energy is one of the two graphs which are quasi-order incomparable. Recently, Huo, Li and Shi found there exists a fixed positive integer N 0, such that for all n > N 0, the energy of the graphs with the third-minimal through the sixth-minimal are determined. In this paper, the N 0 is fixed by a recursive method, and the problem is solved completely.
Keywordsextremal graph minimal energy quasi-order incomparable conjugated tree
Unable to display preview. Download preview PDF.
- 3.Cvetković, D.M., Doob, M., Sachs, H.: Spectra of Graphs-Theory and Application. Academic Press, New York (1980)Google Scholar
- 9.Gutman, I.: The Energy of a Graph: Old and New Results. In: Betten, A., Kohnert, A., Laue, R., Wassermann, A. (eds.) Algebraic Combinatorics and Applications, pp. 196–211. Springer, Berlin (2001)Google Scholar
- 10.Gutman, I., Li, X., Zhang, J.: Graph Energy. In: Dehmer, M., Emmert-Streib, F. (eds.) Analysis of Complex Networks: From Biology to Linguistics, pp. 145–174. Wiley-VCH Verlag, Weinheim (2009)Google Scholar